Bidirected and unidirected capacity installation in telecommunication networks

Authors:
Stan P. M. van Hoesel;Arie M. C. A. Koster;Robert L. M. J. van de Leensel;Martin W. P. Savelsbergh
Affiliations:
Department of Quantitative Economics, Faculty of Economics & Business Admn., University of Maastricht, P.O. Box 616, Maastricht, 6200 MD, Netherlands;Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, D-14195 Berlin, Germany;Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, D-14195 Berlin, Germany;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA
Venue:
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Year:
2003

Citing 4
Cited 2

The convex hull of two core capacitated network design problems

Mathematical Programming: Series A and B
Minimum cost capacity installation for multicommodity network flows

Mathematical Programming: Series A and B - Special issue on computational integer programming
Network Design Using Cut Inequalities

SIAM Journal on Optimization
On the k-cut problem

Operations Research Letters

Algorithms for the non-bifurcated network design problem

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

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the design of telecommunication networks, decisions concerning capacity installation and routing of commodities have to be taken simultaneously. Network Loading problems formalize these decisions in mathematical optimization models. Several variants of the problem exist: bifurcated or non-bifurcated routing, bidirected or unidirected capacity installation, and symmetric versus non-symmetric routing restrictions. Moreover, different concepts of reliability can be considered. In this paper, we study the polyhedral structure of two basic problems for nonbifurcated routing: network loading with bidirected and unidirected capacity installation.We show that strong valid inequalities for the substructure restricted to a single edge, are also strong valid inequalities for the overall models. In a computational study, several classes of inequalities, both for the substucture and the overall problem, are compared on real-life instances for both variants of network loading.