Connectivity-splitting models for survivable network design

DOI10.1002/net.10100zbMath1143.90313OpenAlexW4248309189MaRDI QIDQ4446914

Prakash Mirchandani, Thomas L. Magnanti, Anantaram Balakrishnan

Publication date: 3 February 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10100

zbMATH Keywords

heuristicsinteger programmingworst-case performancenetwork designsurvivabilitymodel formulation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Minimum Cost ≤k Edges Connected Subgraph Problems ⋮ A global optimization algorithm for reliable network design ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ The \(k\)-path tree matroid and its applications to survivable network design ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Stochastic survivable network design problems: theory and practice ⋮ Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems ⋮ Hop-constrained node survivable network design: An application to MPLS over WDM

Uses Software

• SONET

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity-splitting models for survivable network design