941 eng reportzib 0 2006-11-16 2006-11-16 -- 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. 06-47 941 urn:nbn:de:0297-zib-9412 Appeared in: Proceedings International Network Optimization Conference, INOC 2007, Spa, Belgium. Sebastian Orlowski Arie M.C.A. Koster Christian Raack Roland Wessäly 06-47 eng uncontrolled multi-layer network design eng uncontrolled integer programming eng uncontrolled branch-and-cut eng uncontrolled heuristics Informatik, Informationswissenschaft, allgemeine Werke Communication networks [See also 68M10, 94A05] Polyhedral combinatorics, branch-and-bound, branch-and-cut Approximation methods and heuristics ZIB Allgemein BMBF-Eibone MATHEON-B3 https://opus4.kobv.de/opus4-zib/files/941/ZR_06_47.pub.elc.Vers.pdf https://opus4.kobv.de/opus4-zib/files/941/ZR-06-47.pdf https://opus4.kobv.de/opus4-zib/files/941/ZR-06-47.ps