Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
DOI10.1287/OPRE.43.6.1012zbMATH Open0853.90055OpenAlexW2032889054MaRDI QIDQ4887724FDOQ4887724
Authors: Martin Grötschel, Clyde l. Monma, Mechthild Stoer 
Publication date: 13 October 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/da3a307d57fc534651823e28e9fe8dca970d1064
Recommendations
network designsurvivabilitycutting plane algorithmpolyhedral resultsa low-cost communications network
Reliability, availability, maintenance, inspection in operations research (90B25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Communication networks in operations research (90B18)
Cited In (22)
- Title not available (Why is that?)
- A Network Design Problem with Two-Edge Matching Failures
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Polyhedral approaches to the design of survivable networks
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- A dynamic programming algorithm for the local access telecommunication network expansion problem
- A branch‐and‐cut algorithm for the ring spur assignment problem
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Routing of uncertain traffic demands
- A decomposition algorithm for the ring spur assignment problem
- Design of survivable networks
- Title not available (Why is that?)
- Graphs and algorithms in communication networks on seven league boots
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- Low-connectivity network design on series-parallel graphs
- Stochastic survivable network design problems: theory and practice
- An Integer Polytope Related to the Design of Survivable Communication Networks
- On survivable network polyhedra
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
This page was built for publication: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887724)
