The Non-Disjoint m-Ring-Star Problem : polyhedral results and SDH/SONET network design - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

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

Pierre Fouilhoux
Aurélien Questel
  • Fonction : Auteur
  • PersonId : 971612

Résumé

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.
Fichier non déposé

Dates et versions

hal-01270089 , version 1 (05-02-2016)

Identifiants

Citer

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⟩
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More