The Non-Disjoint m-Ring-Star Problem : polyhedral results and SDH/SONET network design

Pierre Fouilhoux 1 Aurélien Questel 1
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. 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.
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01270089
Contributor : Lip6 Publications <>
Submitted on : Friday, February 5, 2016 - 4:09:49 PM
Last modification on : Thursday, March 21, 2019 - 2:32:22 PM

Identifiers

Collections

UPMC | LIP6 | SORBONNE-UNIVERSITE | SU-SCIENCES

Citation

Pierre Fouilhoux, Aurélien Questel. The Non-Disjoint m-Ring-Star Problem : polyhedral results and SDH/SONET network design. International Symposium on Combinatorial Optimization (ISCO 2012), Apr 2012, Athènes, Greece. pp.93-104, ⟨10.1007/978-3-642-32147-4_10⟩. ⟨hal-01270089⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

65

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD