A polyhedral study of the capacity formulation of the multilayer network design problem
From MaRDI portal
Publication:5326800
DOI10.1002/net.21488zbMath1269.90024MaRDI QIDQ5326800
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21488
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
90B10: Deterministic network models in operations research
Related Items
Unsplittable non-additive capacitated network design using set functions polyhedra, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Benders Decomposition for Capacitated Network Design
Cites Work
- Unnamed Item
- Solving survivable two-layer network design problems by metric inequalities
- The convex hull of two core capacitated network design problems
- Design of survivable IP-over-optical networks
- Hop-constrained node survivable network design: An application to MPLS over WDM
- An improved Benders decomposition applied to a multi-layer network design problem
- Minimum cost capacity installation for multicommodity network flows
- A branch-and-cut algorithm for capacitated network design problems
- On capacitated network design cut-set polyhedra
- Separating tight metric inequalities by bilevel programming
- Metric inequalities and the network loading problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Routing Through Virtual Paths in Layered Telecommunication Networks
- k-Partition-based facets of the network design problem
- Capacitated Network Design—Polyhedral Structure and Computation
