scientific article; zbMATH DE number 795223
From MaRDI portal
Publication:4845372
zbMath0839.90132MaRDI QIDQ4845372
Clyde l. Monma, Mechthild Stoer, Martin Grötschel
Publication date: 25 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
facet-defining inequalitiesnetwork designminimum spanning treeSteiner treesurvivable communication networks
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items
A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions, A generic optimization framework for resilient systems, A cutting plane algorithm for computing \(k\)-edge survivability of a network, The multi-layered network design problem, Task scheduling in networks, An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs, Hierarchical survivable network design problems, Separation of partition inequalities with terminals, Redundancy system design for an aircraft door management system, On perfectly two-edge connected graphs, A branch-and-cut algorithm for two-level survivable network design problems, Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs, Finding Totally Independent Spanning Trees with Linear Integer Programming, Design of survivable IP-over-optical networks, A bootstrap heuristic for designing minimum cost survivable networks, On the two-connected planar spanning subgraph polytope, Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction, Efficient methods for the distance-based critical node detection problem in complex networks, Some thoughts on combinatorial optimisation, Fixed parameter tractability of a biconnected bottleneck Steiner network problem, Graph fragmentation problem: analysis and synthesis, Telecommunications network design: Technology impacts and future directions, Erdős–Pósa property of obstructions to interval graphs, On the number of edges in a graph with many two-hop disjoint paths, Valid inequalities and facets for multi‐module survivable network design problem, Robust capacitated Steiner trees and networks with uniform demands, Design of survivable networks with vulnerability constraints, Survivability in Hierarchical Telecommunications Networks Under Dual Homing, An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes, 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., The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, Network disconnection problems in a centralized network, Augmenting edge-connectivity between vertex subsets, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, On the structure and complexity of the 2-connected Steiner network problem in the plane, Optimal design and defense of networks under link attacks, The \(k\)-path tree matroid and its applications to survivable network design, Stochastic survivable network design problems: theory and practice, The swap edges of a multiple-sources routing tree, Equal-need sharing of a network under connectivity constraints, Cutting planes in integer and mixed integer programming, Two-connected Steiner networks: structural properties, On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality, Global optimization of multilevel electricity market models including network design and graph partitioning, Simpler analysis of LP extreme points for traveling salesman and survivable network design problems, On survivable network polyhedra, On the Steiner 2-edge connected subgraph polytope, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems, Bipartition constrained edge-splitting in directed graphs, Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs, Generalized network design problems., 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, On shortest three-edge-connected Steiner networks with Euclidean distance, An efficient approximation algorithm for the survivable network design problem, \(k\)-edge connected polyhedra on series-parallel graphs, Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP, The 2-edge-connected subgraph polyhedron, Exact solution of multicommodity network optimization problems with general step cost functions, Approximating unweighted connectivity problems in parallel, Critical extreme points of the 2-edge connected spanning subgraph polytope, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, Selected Topics in Critical Element Detection, Approximating minimum size \{1,2\}-connected networks, How Do You Defend a Network?, Separation of partition inequalities for the \((1,2)\)-survivable network design problem
