Routing Through Virtual Paths in Layered Telecommunication Networks

DOI10.1287/opre.47.5.693zbMath0976.90014OpenAlexW2145122881MaRDI QIDQ4950814

Geir Dahl, Mechthild Stoer, Alexander Martin

Publication date: 27 April 2000

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/10c31a7c759af198c33f499aaa5dd59eec46c26c

zbMATH Keywords

integer linear programmingtelecommunicationsnetwork configuration problem

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Related Items (max. 100)

The multi-layered network design problem ⋮ Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ A polyhedral study of the capacity formulation of the multilayer network design problem ⋮ Designing WDM optical networks using branch-and-price ⋮ A taxonomy of multilayer network design and a survey of transportation and telecommunication applications ⋮ Solving survivable two-layer network design problems by metric inequalities ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ Cutting planes in integer and mixed integer programming ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ An improved Benders decomposition applied to a multi-layer network design problem

This page was built for publication: Routing Through Virtual Paths in Layered Telecommunication Networks