A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Models and Algorithms for Robust Network Design with Several Traffic Scenarios
[chapter]
2012
Lecture Notes in Computer Science
We consider a robust network design problem: optimum integral capacities need to be installed in a network such that supplies and demands in each of the explicitly known traffic scenarios can be satisfied by a single-commodity flow. In Buchheim et al. (LNCS 6701, 7-17 (2011)), an integer-programming (IP) formulation of polynomial size was given that uses both flow and capacity variables. We introduce an IP formulation that only uses capacity variables and exponentially many, but polynomial time
doi:10.1007/978-3-642-32147-4_24
fatcat:3a743w4nqngphpacb4ggygnnpy