Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements

DOI10.1287/opre.43.6.1012zbMath0853.90055OpenAlexW2032889054MaRDI QIDQ4887724

Mechthild Stoer, Clyde l. Monma, Martin Grötschel

Publication date: 13 October 1996

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

Full work available at URL: https://semanticscholar.org/paper/da3a307d57fc534651823e28e9fe8dca970d1064

zbMATH Keywords

network designsurvivabilitycutting plane algorithmpolyhedral resultsa low-cost communications network

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Routing of uncertain traffic demands, Network Design with Service Requirements: Scaling-up the Size of Solvable Problems, A branch‐and‐cut algorithm for the ring spur assignment problem, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., Stochastic survivable network design problems: theory and practice, A decomposition algorithm for the ring spur assignment problem, A branch-and-cut algorithm for the k-edge connected subgraph problem, A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, Graphs and Algorithms in Communication Networks on Seven League Boots, A Network Design Problem with Two-Edge Matching Failures, A dynamic programming algorithm for the local access telecommunication network expansion problem, Critical extreme points of the 2-edge connected spanning subgraph polytope