Solving survivable two-layer network design problems by metric inequalities
From MaRDI portal
Recommendations
- Hierarchical survivable network design problems
- A branch-and-cut algorithm for two-level survivable network design problems
- A polyhedral approach to multicommodity survivable network design
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- The multi-layered network design problem
Cites work
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A branch-and-cut algorithm for capacitated network design problems
- A polyhedral approach to multicommodity survivable network design
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Combinatorial approaches to multiflow problems
- Design of Survivable Networks: A survey
- Design of survivable IP-over-optical networks
- Geometry of cuts and metrics
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Integer Programming and Combinatorial Optimization
- Metric inequalities and the network loading problem
- Minimum cost capacity installation for multicommodity network flows
- On capacitated network design cut-set polyhedra
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra
- Routing Through Virtual Paths in Layered Telecommunication Networks
- The multi-layered network design problem
- Tight LP‐based lower bounds for wavelength conversion in optical networks
Cited in
(11)- A branch-and-cut algorithm for two-level survivable network design problems
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
- A polyhedral study of the capacity formulation of the multilayer network design problem
- Network loading problem: valid inequalities from 5- and higher partitions
- Separating tight metric inequalities by bilevel programming
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Energy-aware survivable networks
- A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
- Survivable network design with shared-protection routing
- Benders decomposition for capacitated network design
- The robust network loading problem with dynamic routing
This page was built for publication: Solving survivable two-layer network design problems by metric inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429456)
