Designing Hierarchical Survivable Networks

DOI10.1287/opre.46.1.116zbMath0987.90517OpenAlexW2108589465MaRDI QIDQ2781139

Thomas L. Magnanti, Anantaram Balakrishnan, Prakash Mirchandani

Publication date: 18 March 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5115

zbMATH Keywords

heuristicsreliable telecommunication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Branch-and-price algorithm for the resilient multi-level hop-constrained network design ⋮ A global optimization algorithm for reliable network design ⋮ Evolutionary algorithms and matroid optimization problems ⋮ Hierarchical survivable network design problems ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ Single-commodity network design with random edge capacities ⋮ Survivability in Hierarchical Telecommunications Networks Under Dual Homing ⋮ The \(k\)-path tree matroid and its applications to survivable network design ⋮ Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems ⋮ A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem ⋮ New formulations and solution procedures for the hop constrained network design problem. ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

This page was built for publication: Designing Hierarchical Survivable Networks