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.
['Gabriel Bayá', 'Antonio Mauttone', 'Franco Robledo', 'Pablo Romero', 'Gerardo Rubino']
Capacitated m Ring Star Problem under Diameter Constrained Reliability