Abstract
We add random link failures into a celebrated robust network design problem, called Capacitated m-Ring Star Problem (CmRSP), where m rings should connect terminal nodes to a source node at minimum cost. The result is a novel NP-Hard network optimization problem, called Capacitated m-Ring Star Problem Diameter Constrained Reliability, or CmRSP-DCR for short. The hardness of the CmRSP-DCR is formally proved. Then, we heuristically address a GRASP resolution, discuss results and trends for future work.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
