 |
Conference papers
The Non-Disjoint m-Ring-Star Problem : polyhedral results and SDH/SONET network design
Abstract : In this article we study the realistic network topology of Synchronous Digital Hierarchy (SDH) networks. In such a network, a customer must be a node of a ring. We first show that there is no two-index integer formulation for this problem. We then present a mathematical model for the NDRSP along with some classes of valid inequalities that are used as cutting planes in a Branch-and-Cut approach. We also study the dominant polytope of the NDRSP and introduce several polyhedral results. Finally, we present our Branch-and-Cut algorithm and give some experimental results on both random and real instances.
https://hal.archives-ouvertes.fr/hal-01270089
Contributor : Lip6 Publications <>
Submitted on : Friday, February 5, 2016 - 4:09:49 PM
Last modification on : Friday, January 8, 2021 - 5:48:02 PM
Contributor : Lip6 Publications <>
Submitted on : Friday, February 5, 2016 - 4:09:49 PM
Last modification on : Friday, January 8, 2021 - 5:48:02 PM