Design of Survivable Networks: A survey

DOI10.1002/net.20072zbMath1072.90003MaRDI QIDQ5318274

Hervé L. M. Kerivin, Ali Ridha Mahjoub

Publication date: 22 September 2005

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

heuristic; polyhedral approach; survivable network; hop-constraint

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Strong Formulations for 2-Node-Connected Steiner Network Problems, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, Solving survivable two-layer network design problems by metric inequalities, The \(k\) edge-disjoint 3-hop-constrained paths polytope, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron, The \(k\)-path tree matroid and its applications to survivable network design, A global optimization algorithm for reliable network design, Critical extreme points of the 2-edge connected spanning subgraph polytope, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice, Strong Lower Bounds for a Survivable Network Design Problem, Survivability in hierarchical telecommunications networks, A branch-and-cut algorithm for the k-edge connected subgraph problem, A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation, On the Steiner 2-edge connected subgraph polytope

Cites Work

• Design of survivable networks
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• TSPLIB—A Traveling Salesman Problem Library
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item