Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
From MaRDI portal
Publication:3404461
DOI10.1007/978-3-642-02250-0_3zbMath1187.68045OpenAlexW1617772575MaRDI QIDQ3404461
Sebastian Orlowski, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Christian Raack, Pietro Belotti
Publication date: 9 February 2010
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02250-0_3
integer linear programmingcutting planestelecommunication networkspreprocessingmultilayer network designMIP-based heuristics
Related Items
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Towards optimizing the deployment of optical access networks, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Designing WDM optical networks using branch-and-price
- SCIP: solving constraint integer programs
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- An improved Benders decomposition applied to a multi-layer network design problem
- On the spanning tree polyhedron
- Source sink flows with capacity installation in batches
- Minimum cost capacity installation for multicommodity network flows
- Cost-efficient network synthesis from leased lines
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- The multi-layered network design problem
- A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks
- On cut-based inequalities for capacitated network design polyhedra
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Tight LP‐based lower bounds for wavelength conversion in optical networks
- Capacitated Network Design—Polyhedral Structure and Computation
