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

DOI10.1287/OPRE.43.6.1012MaRDI QIDQ4887724zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

network designsurvivabilitycutting plane algorithmpolyhedral resultsa low-cost communications network

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 176255
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• scientific article; zbMATH DE number 795223
• Design of survivable networks
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

Cited in

(24)

• Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• scientific article; zbMATH DE number 795223 (Why is no real title available?)
• 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
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• A network design problem with two-edge matching failures
• Routing of uncertain traffic demands
• scientific article; zbMATH DE number 1184420 (Why is no real title available?)
• A decomposition algorithm for the ring spur assignment problem
• Design of survivable networks
• scientific article; zbMATH DE number 176255 (Why is no real title available?)
• Graphs and algorithms in communication networks on seven league boots
• A branch-and-cut algorithm for the ring spur assignment problem
• 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
• Stochastic survivable network design problems: theory and practice
• Low-connectivity network design on series-parallel graphs
• On survivable network polyhedra
• An Integer Polytope Related to the Design of Survivable Communication Networks

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)