Improved formulations for the ring spur assignment problem

Authors:
Paula Carroll;Bernard Fortz;Martine Labbé;Seán McGarraghy
Affiliations:
Quinn and Smurfit Schools of Business, University College Dublin, Ireland;Département d'Informatique, Faculté des Sciences, Université Libre de Bruxelles;Département d'Informatique, Faculté des Sciences, Université Libre de Bruxelles;Quinn and Smurfit Schools of Business, University College Dublin, Ireland
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 11
Cited 0

A simple min-cut algorithm

Journal of the ACM (JACM)
SONET/SDH ring assignment with capacity constraints

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Two-Connected Networks with Rings of Bounded Cardinality

Computational Optimization and Applications
The Ring Star Problem: Polyhedral analysis and exact algorithm

Networks
Design of Survivable Networks: A survey

Networks
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

Mathematical Programming: Series A and B
A column generation approach for SONET ring assignment

Networks
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
On the asymmetric representatives formulation for the vertex coloring problem

Discrete Applied Mathematics
SNDlib 1.0—Survivable Network Design Library

Networks - Network Optimization (INOC 2007)
New options and insights for survivable transport networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two complete integer programming formulations for the ring spur assignment problem. This problem arises in the design of next generation telecommunications networks. We analyse and compare the formulations in terms of compactness, the resulting LP bound and results from a branch and cut implementation. We present our conclusions with computational results.