964 eng reportzib 0 2007-08-13 2007-08-13 -- 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 into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branch-and-cut approach with problem-specific preprocessing and cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these cutting planes are still useful in the multi-layer context, helping to increase the dual bound and to reduce the optimality gaps. 07-21 1438-0064 975 urn:nbn:de:0297-zib-9641 Appeared in: Telecommunications Modeling, Policy, and Technology. S. Raghavan et al. (eds.) Springer 2008. ISBN 978-0-387-77779-5, pp. 1-23 Arie M.C.A. Koster unknown unknown Sebastian Orlowski Christian Raack Georg Bayer Thomas Engel 07-21 eng uncontrolled telecommunication network eng uncontrolled multi-layer network design eng uncontrolled mixed-integer programming eng uncontrolled cutting planes Informatik, Informationswissenschaft, allgemeine Werke Network design and communication [See also 68R10, 90B18] Communication networks [See also 68M10, 94A05] Polyhedral combinatorics, branch-and-bound, branch-and-cut Mathematical Optimization MATHEON-B3 Applied Optimization https://opus4.kobv.de/opus4-zib/files/964/ZR_07_21.pdf https://opus4.kobv.de/opus4-zib/files/964/ZR_07_21.ps