Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
From MaRDI portal
Publication:4018839
DOI10.1137/0802024zbMath0811.05038OpenAlexW2020130108MaRDI QIDQ4018839
Clyde l. Monma, Mechthild Stoer, Martin Grötschel
Publication date: 16 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/beb903a3614ba4c629e92ddce08665722d21e6cf
communication networksconnectivitynetwork designpolyhedral combinatoricsnetwork survivabilityfacet-inducing inequalities
Communication networks in operations research (90B18) Combinatorial optimization (90C27) Connectivity (05C40)
Related Items (26)
Two-edge connected spanning subgraphs and polyhedra ⋮ Heuristics for the network design problem with connectivity requirements ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Separation of partition inequalities with terminals ⋮ On exact solutions for the minmax regret spanning tree problem ⋮ On perfectly two-edge connected graphs ⋮ On two-connected subgraph polytopes ⋮ A bootstrap heuristic for designing minimum cost survivable networks ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ A metaheuristic for security budget allocation in utility networks ⋮ Facet Generating Techniques ⋮ The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. ⋮ On survivable network polyhedra ⋮ On the dominant of the Steiner 2-edge connected subgraph polytope ⋮ On the Steiner 2-edge connected subgraph polytope ⋮ The box-TDI system associated with 2-edge connected spanning subgraphs ⋮ Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ \(k\)-edge connected polyhedra on series-parallel graphs ⋮ A Network Design Problem with Two-Edge Matching Failures ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems ⋮ New modeling approaches for the design of local access transport area networks ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope ⋮ Directed Steiner problems with connectivity constraints ⋮ Separation of partition inequalities for the \((1,2)\)-survivable network design problem
This page was built for publication: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
