A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

Authors:
Geir Dahl;Mechthild Stoer
Affiliations:
-;-
Venue:
INFORMS Journal on Computing
Year:
1998

Citing 0
Cited 17

Strengthening integrality gaps for capacitated network design and covering problems

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Building Edge-Failure Resilient Networks

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem

Journal of Heuristics
Demand-wise Shared Protection for Meshed Optical Networks

Journal of Network and Systems Management
The Multilevel Capacitated Minimum Spanning Tree Problem

INFORMS Journal on Computing
Survivable network design under optimal and heuristic interdiction scenarios

Journal of Global Optimization
Path Generation Issues for Survivable Network Design

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Connectivity Upgrade Models for Survivable Network Design

Operations Research
Adaptive memory in multistart heuristics for multicommodity network design

Journal of Heuristics
Partition inequalities for capacitated survivable network design based on directed p-cycles

Discrete Optimization
Metric inequalities and the Network Loading Problem

Discrete Optimization
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization
Optimizing IGP link costs for improving IP-level resilience with Loop-Free Alternates

Computer Communications
Design of Survivable Networks Using Three-and Four-Partition Facets

Operations Research
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

INFORMS Journal on Computing
Fractional routing using pairs of failure-disjoint paths

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a cutting plane algorithm for solving the following telecommunications network design problem: given point-to-point traffic demands in a network, specified survivability requirements and a discrete cost/capacity function for each link, find minimum cost capacity expansions satisfying the given demands. This algorithm is based on the polyhedral study described in [19]. In this article we describe the underlying problem, the model and the main ingredients in our algorithm. This includes: initial formulation, feasibility test, separation for strong cutting planes, and primal heuristics. Computational results for a set of real-world problems are reported.