Solving survivable two-layer network design problems by metric inequalities
From MaRDI portal
Publication:429456
DOI10.1007/S10589-010-9364-0zbMATH Open1244.90235OpenAlexW1986884630MaRDI QIDQ429456FDOQ429456
Authors: Sara Mattia 
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.bice.rm.cnr.it/1438/1/TR2_2010.pdf
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Design of Survivable Networks: A survey
- Geometry of cuts and metrics
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra
- Tight LP‐based lower bounds for wavelength conversion in optical networks
- Minimum cost capacity installation for multicommodity network flows
- On capacitated network design cut-set polyhedra
- Integer Programming and Combinatorial Optimization
- Metric inequalities and the network loading problem
- Title not available (Why is that?)
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Combinatorial approaches to multiflow problems
- A polyhedral approach to multicommodity survivable network design
- A branch-and-cut algorithm for capacitated network design problems
- The multi-layered network design problem
- Design of survivable IP-over-optical networks
Cited In (11)
- A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
- Survivable network design with shared-protection routing
- Network loading problem: valid inequalities from 5- and higher partitions
- Energy-aware survivable networks
- A branch-and-cut algorithm for two-level survivable network design problems
- A polyhedral study of the capacity formulation of the multilayer network design problem
- A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
- The robust network loading problem with dynamic routing
- Benders decomposition for capacitated network design
- Separating tight metric inequalities by bilevel programming
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
Uses Software
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)
