Solving survivable two-layer network design problems by metric inequalities

DOI10.1007/s10589-010-9364-0zbMath1244.90235OpenAlexW1986884630MaRDI QIDQ429456

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

zbMATH Keywords

capacity formulationmetric inequalitiesoptical network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Survivable network design with shared-protection routing, The robust network loading problem with dynamic routing, Energy-aware survivable networks, Network loading problem: valid inequalities from 5- and higher partitions, 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, Separating tight metric inequalities by bilevel programming, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Benders Decomposition for Capacitated Network Design

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Design of survivable IP-over-optical networks
• Hop-constrained node survivable network design: An application to MPLS over WDM
• Combinatorial approaches to multiflow problems
• Minimum cost capacity installation for multicommodity network flows
• A polyhedral approach to multicommodity survivable network design
• Quasi-semi-metrics, oriented multi-cuts and related polyhedra
• A branch-and-cut algorithm for capacitated network design problems
• On capacitated network design cut-set polyhedra
• The multi-layered network design problem
• Metric inequalities and the network loading problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Routing Through Virtual Paths in Layered Telecommunication Networks
• Design of Survivable Networks: A survey
• Tight LP‐based lower bounds for wavelength conversion in optical networks
• Integer Programming and Combinatorial Optimization
• Geometry of cuts and metrics