A Branch-and-Cut for the non-disjoint m-Ring-Star problem

Pierre Fouilhoux 1 Aurélien Questel
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185104
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 11:07:03 AM
Last modification on : Thursday, March 21, 2019 - 1:11:05 PM

Links full text

Identifiers

Citation

Pierre Fouilhoux, Aurélien Questel. A Branch-and-Cut for the non-disjoint m-Ring-Star problem. RAIRO - Operations Research, EDP Sciences, 2014, 48 (2), pp.167-188. ⟨10.1051/ro/2014006⟩. ⟨hal-01185104⟩

Share

Metrics

Record views

129