Capacitated m Two-Node Survivable Star Problem

Abstract

A traditional method to connect multiterminal systems is to use rings. The goal of the Capacitated m Ring Star Problem (CmRSP) is to connect terminals by m rings joined only with a source node, and possibly some pending links, at minimum cost.In this paper, we introduce a relaxation for the CmRSP, called Capacitated m Two-Node Survivable Star Problem (CmTNSSP for short). The CmTNSSP belongs to the class of NP-Hard computational problems. Therefore, we address a heuristic GRASP resolution. In consonance with predictions provided by Clyde Monma, the network can be equally robust but cheaper than in the original CmRSP.