A branch-and-cut algorithm for two-level survivable network design problems
From MaRDI portal
Recommendations
Cites work
- A branch-and-cut algorithm for the hub location and routing problem
- A branch-and-cut algorithm for the plant-cycle location problem
- A decomposition algorithm for the ring spur assignment problem
- A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
- A tabu search algorithm for self-healing ring network design.
- Connectivity Upgrade Models for Survivable Network Design
- Design of survivable networks
- Design of Survivable Networks: A survey
- Designing hierarchical survivable networks
- General network design: a unified view of combined location and network design problems
- scientific article; zbMATH DE number 1803762 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- On survivable network polyhedra
- On the Steiner 2-edge connected subgraph polytope
- Optimal capacitated ring trees
- Solving the Two-Connected Network with Bounded Meshes Problem
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- Strong formulations for network design problems with connectivity requirements
- Survivability in hierarchical telecommunications networks
- Survivability in hierarchical telecommunications networks under dual homing
- Telecommunication node clustering with node compatibility and network survivability requirements
- The 2-edge-connected subgraph polyhedron
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Two-connected networks with rings of bounded cardinality
- Two-edge connected spanning subgraphs and polyhedra
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
Cited in
(21)- Branch-and-cut methods for the network design problem with vulnerability constraints
- Redundancy system design for an aircraft door management system
- Systems under attack-survivability rather than reliability: concept, results, and applications
- Stochastic survivable network design problems: theory and practice
- A branch-and-price algorithm for the ring-tree facility location problem
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- On the chance-constrained minimum spanning \(k\)-core problem
- A branch and cut algorithm for the hierarchical network design problem
- Survivability in hierarchical telecommunications networks under dual homing
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Hierarchical survivable network design problems
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Solving survivable two-layer network design problems by metric inequalities
- The ring/-rings network design problem: model and branch-and-cut algorithm
- The edge-labeled survivable network design problem: formulations and branch-and-cut
- A network design problem with two-edge matching failures
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
- A branch-and-cut approach for minimum cost multi-level network design
- A survivable variant of the ring star problem
- A hub location problem with fully interconnected backbone and access networks
This page was built for publication: A branch-and-cut algorithm for two-level survivable network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342262)
