Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • Treffer 7 von 25
Zurück zur Trefferliste

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

Zitieren Sie bitte immer diese 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.

Volltext Dateien herunterladen

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Sebastian Orlowski, Arie M.C.A. Koster, Christian Raack, Roland Wessäly
Dokumentart:ZIB-Report
Freies Schlagwort / Tag:branch-and-cut; heuristics; integer programming; multi-layer network design
MSC-Klassifikation: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
Datum der Erstveröffentlichung:16.11.2006
Schriftenreihe (Bandnummer):ZIB-Report (06-47)
ZIB-Reportnummer:06-47
Verlagspublikation: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.