Models and Algorithms for Robust Network Design with Several Traffic Scenarios

We consider a robust network design problem: optimum in- tegral 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 separable constraints. We discuss the advantages of the latter formulation for branch-and-cut implemenations and evaluate preliminary computational results for the root bounds. We define a class of instances that is difficult for IP-based approaches. Finally, we design and implement a heuristic solution approach based on the exploration of large neighborhoods of carefully selected size and evaluate it on the dif- ficult instances. The results are encouraging, with a good understanding of the trade-off between solution quality and neighborhood size