A branch-and-cut algorithm for two-level survivable network design problems
DOI10.1016/J.COR.2015.09.008zbMATH Open1349.90171OpenAlexW2134932236MaRDI QIDQ342262FDOQ342262
Authors: Inmaculada Rodríguez-Martín, Juan-José Salazar-González, Hande Yaman 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/36858
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Mixed integer programming (90C11)
Cites Work
- General network design: a unified view of combined location and network design problems
- Title not available (Why is that?)
- Design of Survivable Networks: A survey
- Strong formulations for network design problems with connectivity requirements
- Design of survivable networks
- Optimal capacitated ring trees
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Solving the Two-Connected Network with Bounded Meshes Problem
- Designing hierarchical survivable networks
- Connectivity Upgrade Models for Survivable Network Design
- Telecommunication node clustering with node compatibility and network survivability requirements
- 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.
- Two-connected networks with rings of bounded cardinality
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Survivability in hierarchical telecommunications networks under dual homing
- 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
- Two-edge connected spanning subgraphs and polyhedra
- On survivable network polyhedra
- The 2-edge-connected subgraph polyhedron
- Survivability in hierarchical telecommunications networks
- Title not available (Why is that?)
- On the Steiner 2-edge connected subgraph polytope
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
Cited In (21)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- Solving survivable two-layer network design problems by metric inequalities
- The ring/\(\kappa\)-rings network design problem: model and branch-and-cut algorithm
- A network design problem with two-edge matching failures
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- The edge-labeled survivable network design problem: formulations and branch-and-cut
- Branch-and-cut methods for the network design problem with vulnerability constraints
- Redundancy system design for an aircraft door management system
- Hierarchical survivable network design problems
- A survivable variant of the ring star problem
- A branch-and-price algorithm for the ring-tree facility location problem
- On the chance-constrained minimum spanning \(k\)-core problem
- A hub location problem with fully interconnected backbone and access networks
- Systems under attack-survivability rather than reliability: concept, results, and applications
- A branch and cut algorithm for the hierarchical network design problem
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
- Survivability in hierarchical telecommunications networks under dual homing
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Stochastic survivable network design problems: theory and practice
- 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
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)
