Design of survivable networks with vulnerability constraints

DOI10.1016/J.EJOR.2016.09.003zbMath1380.90072OpenAlexW2516951958WikidataQ57705352 ScholiaQ57705352MaRDI QIDQ1698886

Markus Leitner, Luís Gouveia

Publication date: 16 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.09.003

zbMATH Keywords

integer programmingnetworkssurvivable network designOR in telecommunicationshop-constraints

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (6)

On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Branch-and-cut methods for the network design problem with vulnerability constraints ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Graph fragmentation problem: analysis and synthesis ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints

Cites Work

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• On a measure of communication network vulnerability
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Design of Survivable Networks: A survey
• Hop‐level flow formulation for the survivable network design with hop constraints problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Design of survivable networks with vulnerability constraints