An improved Benders decomposition applied to a multi-layer network design problem

Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bilayer networks, comparing with Knippelā€™s previous results. Citation Technical Reports of the ULB Computer Science … Read more

Single-layer Cuts for Multi-layer Network Design Problems

We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation that takes many practical side constraints … Read more