TY - GEN A1 - Orlowski, Sebastian A1 - Koster, Arie M. C. A. A1 - Raack, Christian A1 - Wessäly, Roland T1 - Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics N2 - 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. KW - multi-layer network design KW - integer programming KW - branch-and-cut KW - heuristics Y1 - 2006 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/365 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-3654 ER -