Hierarchical survivable network design problems

DOI10.1016/j.endm.2016.03.030zbMath1351.90068OpenAlexW2399744342MaRDI QIDQ325448

Hande Yaman, Inmaculada Rodríguez-Martín, Juan-José Salazar-González

Publication date: 18 October 2016

Full work available at URL: http://hdl.handle.net/11693/36843

zbMATH Keywords

branch-and-cut algorithmnetwork designsurvivability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (1)

Facility location with tree topology and radial distance constraints

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for the hub location and routing 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.
• Two-connected networks with rings of bounded cardinality
• Generalized local branching heuristics and the capacitated ring tree problem
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• Designing Hierarchical Survivable Networks
• Solving the Two-Connected Network with Bounded Meshes 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

This page was built for publication: Hierarchical survivable network design problems