Publication:4035361
From MaRDI portal
zbMath0766.05052MaRDI QIDQ4035361
Martin Grötschel, Clyde l. Monma, Mechthild Stoer
Publication date: 18 May 1993
90C90: Applications of mathematical programming
90C27: Combinatorial optimization
05C40: Connectivity
Related Items
Strong Formulations for 2-Node-Connected Steiner Network Problems, On the dominant of the Steiner 2-edge connected subgraph polytope, Two-edge connected spanning subgraphs and polyhedra, On perfectly two-edge connected graphs, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., New modeling approaches for the design of local access transport area networks, On survivable network polyhedra, A cutting plane algorithm for computing \(k\)-edge survivability of a network, 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, \(k\)-edge connected polyhedra on series-parallel graphs, On the Steiner 2-edge connected subgraph polytope