In this paper we propose a heuristic method to solve the Capacitated m-Ring-Star Problem

which has many practical applications in communication networks. The problem consists of finding m

rings (simple cycles) visiting a central depot...

In this paper we propose a heuristic method to solve the Capacitated m-Ring-Star Problem which has many practical applications in communication networks. The problem consists of finding m rings (simple cycles) visiting a central depot, a subset...

We address the Capacitated m-Ring-Star Problem in which the aim is to find m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential Steiner nodes, while customers not belonging to any ring must...

In this paper we propose a heuristic method to solve the Capacitated m-Ring Star problem [1] which has many applications in the communication networks. The problem consists of finding m rings (cycles) that visit a central depot, a subset...

We address the Capacitated m-Ring-Star Problem (CmRSP) in which the goal is to find m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must...