On the hop-constrained survivable network design problem with reliable edges

DOI10.1016/j.cor.2015.05.009zbMath1349.90158OpenAlexW1791125896MaRDI QIDQ342080

Quentin Botton, Bernard Fortz, Luís Gouveia

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.009

zbMATH Keywords

network designsurvivabilitybenders decompositionbranch-and-cut algorithmshop constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Layered graph approaches for combinatorial optimization problems ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints ⋮ Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Unnamed Item
• An improved Benders decomposition applied to a multi-layer network design problem
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• The complexity of finding maximum disjoint paths with length constraints
• Design of Survivable Networks: A survey

This page was built for publication: On the hop-constrained survivable network design problem with reliable edges