The k-Edge-Connected Spanning Subgraph Polyhedron
From MaRDI portal
Publication:4296519
DOI10.1137/S0895480191222665zbMath0821.90123MaRDI QIDQ4296519
Publication date: 19 June 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
facet-defining inequalities; polyhedron; convex hull; facet; outer planar graph; \(k\)-edge-connected spanning subgraphs
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
05C40: Connectivity
Related Items
On the dominant of the Steiner 2-edge connected subgraph polytope, On perfectly two-edge connected graphs, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., On survivable network polyhedra, On two-connected subgraph polytopes, \(k\)-edge connected polyhedra on series-parallel graphs, The 2-edge-connected subgraph polyhedron, Critical extreme points of the 2-edge connected spanning subgraph polytope, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, On the Steiner 2-edge connected subgraph polytope