We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A branch-and-cut for the Non-Disjoint m-Ring-Star Problem.
- Authors
Fouilhoux, Pierre; Questel, Aurélien
- Abstract
In this article we study the realistic network topology of Synchronous Digital Hierarchy (SDH) networks. We describe how providers fulfill customer connectivity requirements. We show that SDH Network design reduces to the Non-Disjoint m-Ring-Star Problem (NDRSP). We first show that there is no two-index integer formulation for this problem. We then present a natural 3-index formulation for the NDRSP together with some classes of valid inequalities that are used as cutting planes in a Branch-and-Cut approach. We propose a polyhedral study of a polytope associated with this formulation. Finally, we present our Branch-and-Cut algorithm and give some experimental results on both random and real instances.
- Subjects
SYNCHRONOUS digital hierarchy (Data transmission); ELECTRIC network topology; MATHEMATICAL programming; POLYTOPES; INDEXES
- Publication
RAIRO -- Operations Research, 2014, Vol 48, Issue 2, p167
- ISSN
0399-0559
- Publication type
Article
- DOI
10.1051/ro/2014006