# An Exact Algorithm for Robust Network Design

Buchheim, Christoph and Liers, Frauke and Sanita, Laura
(2011)
*An Exact Algorithm for Robust Network Design.*
**Published In:**
Network Optimization : 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, Lecture notes in computer science. 6701 Springer Verlag 2011, pp. 7-14.

## 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.

Download: |
PDF
- Preprinted Version
Download (140Kb) | Preview |
---|---|

Export as: | |

Editorial actions: |
View Item (Login required) |

ZAIK Number: | zaik2011-615 |
---|---|

Depositing User: | Christoph Buchheim |

Date Deposited: | 29 Apr 2011 00:00 |

Last Modified: | 09 Jan 2012 13:32 |

URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/615 |