scientific article; zbMATH DE number 795223
From MaRDI portal
Publication:4845372
zbMATH Open0839.90132MaRDI QIDQ4845372FDOQ4845372
Authors: Martin Grötschel, Clyde l. Monma, Mechthild Stoer 
Publication date: 25 June 1996
Title of this publication is not available (Why is that?)
Recommendations
minimum spanning treenetwork designSteiner treefacet-defining inequalitiessurvivable communication networks
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Cited In (only showing first 100 items - show all)
- \(k\)-edge connected polyhedra on series-parallel graphs
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions
- The swap edges of a multiple-sources routing tree
- Design of Survivable Networks: A survey
- Strong formulations for network design problems with connectivity requirements
- Survivable networks, linear programming relaxations and the parsimonious property
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
- A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
- Efficient methods for the distance-based critical node detection problem in complex networks
- Title not available (Why is that?)
- The 2-edge-connected subgraph polyhedron
- Finding totally independent spanning trees with linear integer programming
- Heuristics for the network design problem with connectivity requirements
- Exact solution of multicommodity network optimization problems with general step cost functions
- Survivability in hierarchical telecommunications networks
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- Title not available (Why is that?)
- On perfectly two-edge connected graphs
- Telecommunications network design: Technology impacts and future directions
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- Connectivity Upgrade Models for Survivable Network Design
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Survivable network design with shared-protection routing
- Global optimization of multilevel electricity market models including network design and graph partitioning
- Design of survivable IP-over-optical networks
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes
- On the Steiner 2-edge connected subgraph polytope
- Multiobjective design of survivable IP networks
- Topological design of survivable mesh-based transport networks
- Augmenting edge-connectivity between vertex subsets
- Equal-need sharing of a network under connectivity constraints
- On the number of edges in a graph with many two-hop disjoint paths
- Approximating minimum size \{1,2\}-connected networks
- A polyhedral approach to multicommodity survivable network design
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- Online and Stochastic Survivable Network Design
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Design of survivable networks
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Design of communication networks with survivability constraints
- Selected topics in critical element detection
- Title not available (Why is that?)
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- A bootstrap heuristic for designing minimum cost survivable networks
- Hierarchical survivable network design problems
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation
- On the structure and complexity of the 2-connected Steiner network problem in the plane
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- Connectivity-splitting models for survivable network design
- A branch-and-cut algorithm for two-level survivable network design problems
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
- The multi-layered network design problem
- Strong lower bounds for a survivable network design problem
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Cutting planes in integer and mixed integer programming
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- Designing survivable networks with zero-suppressed binary decision diagrams
- Telecommunication node clustering with node compatibility and network survivability requirements
- Generalized network design problems.
- Price of Stability in Survivable Network Design
- Optimal design and defense of networks under link attacks
- Survivability in hierarchical telecommunications networks under dual homing
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Low-connectivity network design on series-parallel graphs
- Stochastic survivable network design problems: theory and practice
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
- Design of survivable networks with vulnerability constraints
- The \(k\)-path tree matroid and its applications to survivable network design
- Properties of optimal survivable paths in a graph
- On survivable network polyhedra
- An efficient approximation algorithm for the survivable network design problem
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Network synthesis under survivability constraints
- Some thoughts on combinatorial optimisation
- More facets for survivable networks
- Approximating unweighted connectivity problems in parallel
- Circular and radial design comparison of survivability in asymmetrical hierarchical networks
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem
- Polyhedral approaches to the design of survivable networks
- Title not available (Why is that?)
- Cost-effective designs of fault-tolerant access networks in communication systems
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Large scale linear programs and heuristics for the design of survivable telecommunication networks
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem
- Formulations for designing robust networks. An application to wind power collection
- Splitting off edges between two subsets preserving the edge-connectivity of the graph.
- Network disconnection problems in a centralized network
- Network design with vulnerability constraints and probabilistic edge reliability
- Bipartition constrained edge-splitting in directed graphs
- A graph based model for survivability applications
- Robust capacitated Steiner trees and networks with uniform demands
- Valid inequalities and facets for multi‐module survivable network design problem
- Title not available (Why is that?)
- Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845372)
