Publication:4845372
From MaRDI portal
zbMath0839.90132MaRDI QIDQ4845372
Martin Grötschel, Clyde l. Monma, Mechthild Stoer
Publication date: 25 June 1996
facet-defining inequalities; network design; minimum spanning tree; Steiner tree; survivable communication networks
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
Related Items
Network disconnection problems in a centralized network, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems, Bipartition constrained edge-splitting in directed graphs, Cutting planes in integer and mixed integer programming, On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality, Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs, Design of survivable IP-over-optical networks, The \(k\)-path tree matroid and its applications to survivable network design, An efficient approximation algorithm for the survivable network design problem, Exact solution of multicommodity network optimization problems with general step cost functions, On perfectly two-edge connected graphs, On the two-connected planar spanning subgraph polytope, Some thoughts on combinatorial optimisation, Splitting off edges between two subsets preserving the edge-connectivity of the graph., The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., On shortest three-edge-connected Steiner networks with Euclidean distance, On survivable network polyhedra, Generalized network design problems., Approximating unweighted connectivity problems in parallel, Approximating minimum size \{1,2\}-connected networks, Separation of partition inequalities for the \((1,2)\)-survivable network design problem, A cutting plane algorithm for computing \(k\)-edge survivability of a network, A bootstrap heuristic for designing minimum cost survivable networks, On the structure and complexity of the 2-connected Steiner network problem in the plane, The multi-layered network design problem, Separation of partition inequalities with terminals, The swap edges of a multiple-sources routing tree, Two-connected Steiner networks: structural properties, \(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
