Authors
Sebastian Orlowski, Arie MCA Koster, Christian Raack, Roland Wessäly
Publication date
2006/11/22
Description
This paper deals with MIP-based primal heuristics to be used within a branch-and-cut approach for solving multi-layer telecommunication network design problems. Based on a mixed-integer programming formulation for two network layers, we present three heuristics for solving important subproblems, two of which solve a sub-MIP. On multi-layer planning instances with many parallel logical links, we show the effectiveness of our heuristics in finding good solutions early in the branch-and-cut search tree.
Total citations
Scholar articles
S Orlowski, AMCA Koster, C Raack, R Wessäly - 2006