Learn More
In this paper, we consider a combinatorial optimization problem that arises in telecommunications networks design. It is known as the SONET ring assignment problem (SRAP). In this problem, each client site has to be assigned to exactly one SONET ring and a special ring interconnects the other rings together. The problem is to find a feasible assignment of(More)
We consider the problem of interconnecting a set of customer sites using SONET rings of equal capacity, which can be defined as follows: Given an undirected graph G = (V, E) with nonnegative edge weight d uv , (u, v) ∈ E, and two integers k and B, find a partition of the nodes of G into k subsets so that the total weight of the edges connecting the nodes in(More)
  • 1