scientific article; zbMATH DE number 176255
From MaRDI portal
Publication:4035361
Recommendations
- scientific article; zbMATH DE number 795223
- Design of survivable networks
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Polyhedral approaches to the design of survivable networks
- A polyhedral approach to multicommodity survivable network design
Cited in
(39)- Design of survivable networks
- Two-edge connected spanning subgraphs and polyhedra
- A polyhedral approach to multicommodity survivable network design
- 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
- Topological design of survivable mesh-based transport 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
- Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis)
- k-edge connected polyhedra on series-parallel graphs
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Strong lower bounds for a survivable network design problem
- Survivability in hierarchical telecommunications networks
- Survivability in hierarchical telecommunications networks under dual homing
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- Generalized network design polyhedra
- Design of communication networks with survivability constraints
- Telecommunication node clustering with node compatibility and network survivability requirements
- The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
- On the Steiner 2-edge connected subgraph polytope
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- The k edge-disjoint 3-hop-constrained paths polytope
- An Integer Polytope Related to the Design of Survivable Communication Networks
- scientific article; zbMATH DE number 1058029 (Why is no real title available?)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- scientific article; zbMATH DE number 1535630 (Why is no real title available?)
- More facets for survivable networks
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Polyhedral approaches to the design of survivable networks
- Design of Survivable Networks: A survey
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Probabilistic properties of highly connected random geometric graphs
- On the dominant of the Steiner 2-edge connected subgraph polytope
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
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 Q4035361)
