Routing Through Virtual Paths in Layered Telecommunication Networks

DOI10.1287/OPRE.47.5.693MaRDI QIDQ4950814zbMATH OpenOpenAlexFDO

Authors Geir Dahl, Alexander Martin, Mechthild Stoer

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 programmingnetwork configuration problemtelecommunications

Mathematics Subject Classification ID

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

Recommendations

• Capacitated Network Design—Polyhedral Structure and Computation
• Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Multicommodity network flow models and algorithms in telecommunications
• A model for the design of a minimum-cost telecommunications network

Cited in

(16)

• An improved Benders decomposition applied to a multi-layer network design problem
• Reroute sequence planning in telecommunication networks and compact vector summation.
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
• The multi-layered network design problem
• Integer programming approach to the data traffic paths recovering problem
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
• On the minimum cost multiple-source unsplittable flow problem
• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• Unsplittable non-additive capacitated network design using set functions polyhedra
• Designing WDM optical networks using branch-and-price
• Solving survivable two-layer network design problems by metric inequalities
• Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
• A polyhedral study of the capacity formulation of the multilayer network design problem
• An integer programming approach to routing in daisy networks
• Cutting planes in integer and mixed integer programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950814)