A branch-and-cut algorithm for two-level survivable network design problems
From MaRDI portal
Publication:342262
DOI10.1016/j.cor.2015.09.008zbMath1349.90171OpenAlexW2134932236MaRDI QIDQ342262
Inmaculada Rodríguez-Martín, Hande Yaman, Juan-José Salazar-González
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
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items
A branch-and-price algorithm for the ring-tree facility location problem, 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, On the chance-constrained minimum spanning \(k\)-core problem
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal capacitated ring trees
- A branch-and-cut algorithm for the hub location and routing problem
- Design of survivable networks
- Two-edge connected spanning subgraphs and polyhedra
- 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
- On survivable network polyhedra
- General network design: a unified view of combined location and network design problems
- The 2-edge-connected subgraph polyhedron
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Designing Hierarchical Survivable Networks
- Survivability in hierarchical telecommunications networks
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing
- Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
- The Capacitated m-Ring-Star Problem
- On the Steiner 2-edge connected subgraph polytope
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Solving the Two-Connected Network with Bounded Meshes Problem
- A branch-and-cut algorithm for the plant-cycle location problem
- Strong formulations for network design problems with connectivity requirements
- A decomposition algorithm for the ring spur assignment problem
- Connectivity Upgrade Models for Survivable Network Design
- Design of Survivable Networks: A survey
