scientific article
From MaRDI portal
Publication:4035361
zbMath0766.05052MaRDI QIDQ4035361
Clyde l. Monma, Mechthild Stoer, Martin Grötschel
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Connectivity (05C40)
Related Items
Two-edge connected spanning subgraphs and polyhedra, A cutting plane algorithm for computing \(k\)-edge survivability of a network, Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron, Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice, The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut, On perfectly two-edge connected graphs, On two-connected subgraph polytopes, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, A bootstrap heuristic for designing minimum cost survivable networks, The \(k\) edge-disjoint 3-hop-constrained paths polytope, 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, A branch-and-cut algorithm for the k-edge connected subgraph problem, Probabilistic properties of highly connected random geometric graphs, \(k\)-edge connected polyhedra on series-parallel graphs, Strong Formulations for 2-Node-Connected Steiner Network Problems, New modeling approaches for the design of local access transport area networks
