Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
From MaRDI portal
Publication:4887724
DOI10.1287/opre.43.6.1012zbMath0853.90055MaRDI QIDQ4887724
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
network design; survivability; cutting plane algorithm; polyhedral results; a low-cost communications network
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90B18: Communication networks in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
Routing of uncertain traffic demands, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., A dynamic programming algorithm for the local access telecommunication network expansion problem, Critical extreme points of the 2-edge connected spanning subgraph polytope