We present an evaluation of a Lagrangean-based branch-and-bound algorithm with additional valid inequalities for the capacitated network design problem. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show how these inequalities can be considered in a Lagrangean relaxation without destroying the computationally simple structure of the subproblems. We present an extensive computational study on a large set of benchmark data. The results show that the presented algorithm outperforms many other exact and heuristical solvers in terms of running time and solution quality. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kliewer, G., & Timajev, L. (2005). Relax-and-cut for capacitated network design. In Lecture Notes in Computer Science (Vol. 3669, pp. 47–58). Springer Verlag. https://doi.org/10.1007/11561071_7
Mendeley helps you to discover research relevant for your work.