Cost-efficient network synthesis from leased lines
From MaRDI portal
Publication:1383114
DOI10.1023/A:1018984102311zbMath0895.90089MaRDI QIDQ1383114
Dimitris Alevras, Roland Wessäly, Martin Grötschel
Publication date: 2 April 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
heuristicsroutingcutting plane algorithmsurvivable networkstelecommunication network designnetwork capacity planning
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Communication, information (94A99)
Related Items (4)
Valid inequalities and facets for multi‐module survivable network design problem ⋮ Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ A directed cycle-based column-and-cut generation method for capacitated survivable network design
This page was built for publication: Cost-efficient network synthesis from leased lines
