Heuristics, LPs, and Trees on Trees: Network Design Analyses

DOI10.1287/OPRE.44.3.478zbMATH Open0864.90114OpenAlexW2065461399MaRDI QIDQ5689795FDOQ5689795

Authors: Anantaram Balakrishnan, Thomas L. Magnanti, P. Mirchandani 

Publication date: 7 January 1997

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

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

Recommendations

• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• scientific article; zbMATH DE number 795223
• Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems

zbMATH Keywords

LP relaxationcomposite heuristic solution proceduremulti-tier, survivable network designoverlay optimizationuncapacitated multicommodity network design

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35)

Cited In (5)

• Secure Overlay Network Design
• Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
• Secure overlay network design
• New formulations and solution procedures for the hop constrained network design problem.
• The service overlay network design problem for interactive internet applications

This page was built for publication: Heuristics, LPs, and Trees on Trees: Network Design Analyses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689795)