Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics

Please always quote using this URN: urn:nbn:de:0297-zib-9412
  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Sebastian Orlowski, Arie M.C.A. Koster, Christian Raack, Roland Wessäly
Document Type:ZIB-Report
Tag:branch-and-cut; heuristics; integer programming; multi-layer network design
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B18 Communication networks [See also 68M10, 94A05]
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C59 Approximation methods and heuristics
Date of first Publication:2006/11/16
Series (Serial Number):ZIB-Report (06-47)
ZIB-Reportnumber:06-47
Published in:Appeared in: Proceedings International Network Optimization Conference, INOC 2007, Spa, Belgium.
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.