An exact algorithm for robust network design

Buchheim C, Liers F, Sanità L (2011)

Publication Status: Published

Publication Type: Book chapter / Article in edited volumes

Publication year: 2011

Publisher: Springer

Edited Volumes: Network Optimization

Series: Lecture Notes in Computer Science

City/Town: Berlin Heidelberg

Book Volume: 6701

Pages Range: 7-17

Event location: Hamburg

ISBN: 9783642215261

DOI: 10.1007/978-3-642-21527-8_2

Abstract

Modern life heavily relies on communication networks that operate efficiently. A crucial issue for the design of communication networks is robustness with respect to traffic fluctuations, since they often lead to congestion and traffic bottlenecks. In this paper, we address an NP-hard single commodity robust network design problem, where the traffic demands change over time. For k different times of the day, we are given for each node the amount of single-commodity flow it wants to send or to receive. The task is to determine the minimum-cost edge capacities such that the flow can be routed integrally through the net at all times. We present an exact branch-and-cut algorithm, based on a decomposition into biconnected network components, a clever primal heuristic for generating feasible solutions from the linear-programming relaxation, and a general cutting-plane separation routine that is based on projection and lifting. By presenting extensive experimental results on realistic instances from the literature, we show that a suitable combination of these algorithmic components can solve most of these instances to optimality. Furthermore, cutting-plane separation considerably improves the algorithmic performance. © 2011 Springer-Verlag.

Authors with CRIS profile

Frauke Liers-Bergmann Professur für Optimization under Uncertainty & Data Analysis

Involved external institutions

Universität zu Köln DE Germany (DE) École Polytechnique Fédérale de Lausanne (EPFL) CH Switzerland (CH)

How to cite

APA:

Buchheim, C., Liers, F., & Sanità, L. (2011). An exact algorithm for robust network design. In Julia Pahl, Torsten Reiners, Stefan Voß (Eds.), Network Optimization. (pp. 7-17). Berlin Heidelberg: Springer.

MLA:

Buchheim, Christoph, Frauke Liers, and Laura Sanità. "An exact algorithm for robust network design." Network Optimization. Ed. Julia Pahl, Torsten Reiners, Stefan Voß, Berlin Heidelberg: Springer, 2011. 7-17.

BibTeX: Download