Journal ArticleDOI
A polyhedral approach to multicommodity survivable network design
Mechthild Stoer,Geir Dahl +1 more
Reads0
Chats0
TLDR
In this paper, the authors studied the problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails.Abstract:
The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and nonredundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. A cutting plane algorithm and heuristics for the problem are described, and preliminary computational results are reported.read more
Citations
More filters
Book
Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice
TL;DR: The Exponential Potential Function - Key Ideas and Computational Experiments are presented.
Journal ArticleDOI
Optical network design and restoration
TL;DR: This paper reports test results for large carrier-scale networks that indicate that subsecond restoration, high capacity efficiency, and scalability can be achieved without fault isolation and with moderate processing.
Journal ArticleDOI
A survey on benders decomposition applied to fixed-charge network design problems
TL;DR: Network design problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of origin-destination pair demands.
Book ChapterDOI
Multicommodity Capacitated Network Design
TL;DR: Network design models have wide applications in telecommunications and transportation planning and the objective is to determine the optimal amounts of flows to be routed and the facilities to be installed.
Journal ArticleDOI
Minimum cost capacity installation for multicommodity network flows
TL;DR: This paper considers the problem of minimum cost installation of capacity on the arcs to ensure that the required demands can be shipped simultaneously between node pairs and describes two classes of strong valid inequalities.
References
More filters
Book
Integer and Combinatorial Optimization
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Journal ArticleDOI
Solving Large-Scale Zero-One Linear Programming Problems
TL;DR: The results indicate that cutting-planes related to the facets of the underlying polytope are an indispensable tool for the exact solution of this class of problem.
Journal ArticleDOI
Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
TL;DR: Computer results on real-world telephone network design problems demonstrate the effectiveness of the cutting plane method, which can be formulated as a minimum cost network design problem with certain low-connectivity constraints.
Related Papers (5)
Capacitated Network Design—Polyhedral Structure and Computation
Daniel Bienstock,Oktay Günlük +1 more