Branch-and-cut methods for the network design problem with vulnerability constraints
From MaRDI portal
Publication:1652559
DOI10.1016/j.cor.2017.10.005zbMath1391.90147OpenAlexW2765289774MaRDI QIDQ1652559
Markus Leitner, Martim Joyce-Moniz, Luís Gouveia
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.10.005
integer programmingnetworksBenders decompositionsurvivable network designOR in telecommunicationshop-constraints
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items (4)
Efficient methods for the distance-based critical node detection problem in complex networks ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Express shipment service network design with complex routes
Cites Work
- Unnamed Item
- Hop constrained Steiner trees with multiple root nodes
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- The complexity of finding two disjoint paths with min-max objective function
- An improved Benders decomposition applied to a multi-layer network design problem
- Partitioning procedures for solving mixed-variables programming problems
- On implementing the push-relabel method for the maximum flow problem
- A Benders decomposition based framework for solving cable trench problems
- Design of survivable networks with vulnerability constraints
- The two-level diameter constrained spanning tree problem
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- An algorithm for the resource constrained shortest path problem
- On a measure of communication network vulnerability
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Design of Survivable Networks: A survey
- Hop‐level flow formulation for the survivable network design with hop constraints problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
This page was built for publication: Branch-and-cut methods for the network design problem with vulnerability constraints
