The non-disjoint m-ring-star problem: polyhedral results and SDH/SONET network design

Authors:
Pierre Fouilhoux;Aurélien Questel
Affiliations:
Laboratoire LIP6, Université Pierre et Marie Curie, Paris, France;Laboratoire LIP6, Université Pierre et Marie Curie, Paris, France
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 6
Cited 0

Polyhedral study of the capacitated vehicle routing problem

Mathematical Programming: Series A and B
The Steiner Traveling Salesman Polytope and Related Polyhedra

SIAM Journal on Optimization
The Ring Star Problem: Polyhedral analysis and exact algorithm

Networks
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

Operations Research
The Capacitated m-Ring-Star Problem

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.