Universität zu Köln

Cacchiani, Valentina, Jünger, Michael, Liers, Frauke, Lodi, Andrea and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2014). Single-Commodity Robust Network Design with Finite and Hose Demand Sets. Working Paper.

Preview

PDF inf-12.pdf Download (342kB) | Preview

Abstract

We study a single-commodity Robust Network Design problem (sRND) defined on an undirected graph. Our goal is to determine minimum cost capacities such that any traffic demand from a given uncertainty set can be satisfied by a feasible single-commodity flow. We consider two ways of representing the uncertainty set, either as a finite list of scenarios or as a polytope. We propose a branch-and- cut algorithm to derive optimal solutions to sRND, built on a capacity-based integer linear programming formulation. It is strenghtened with valid inequalities derived as {0,1/2 }-Chvátal-Gomory cuts. Since the formulation contains exponentially many constraints, we provide practical separation algorithms. Extensive computational experiments show that our approach is effective, in comparison to existing approaches from the literature as well as to solving a flow based formulation by a general purpose solver.

Item Type:	Monograph (Working Paper)
Creators:	Creators Email ORCID ORCID Put Code Cacchiani, Valentina UNSPECIFIED UNSPECIFIED UNSPECIFIED Jünger, Michael UNSPECIFIED UNSPECIFIED UNSPECIFIED Liers, Frauke UNSPECIFIED UNSPECIFIED UNSPECIFIED Lodi, Andrea UNSPECIFIED UNSPECIFIED UNSPECIFIED Schmidt, Daniel R. UNSPECIFIED https://orcid.org/0000-0001-7381-912X UNSPECIFIED
URN:	urn:nbn:de:hbz:38-550561
Date:	2014
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Refereed:	No
URI:	http://kups.ub.uni-koeln.de/id/eprint/55056