Branch-and-cut methods for the network design problem with vulnerability constraints
type: Item
instance of: scholarly article
title: Branch-and-cut methods for the network design problem with vulnerability constraints
zbMATH Open document ID: 1391.90147
author: Martim Joyce-Moniz
author: Markus Leitner
author: Luis Gouveia
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6901558
zbMATH Keywords: networks
zbMATH Keywords: integer programming
zbMATH Keywords: survivable network design
zbMATH Keywords: hop-constraints
zbMATH Keywords: OR in telecommunications
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
full work available at URL: j.cor.2017.10.005
OpenAlex ID: W2765289774
cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
cites work: An algorithm for the resource constrained shortest path problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A Benders decomposition based framework for solving cable trench problems
cites work: On implementing the push-relabel method for the maximum flow problem
cites work: Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: On a measure of communication network vulnerability
cites work: An improved Benders decomposition applied to a multi-layer network design problem
cites work: Design of survivable networks with vulnerability constraints
cites work: Hop constrained Steiner trees with multiple root nodes
cites work: The two-level diameter constrained spanning tree problem
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: Design of Survivable Networks: A survey
cites work: Q5294061
cites work: Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
cites work: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
cites work: The complexity of finding two disjoint paths with min-max objective function
cites work: Hop‐level flow formulation for the survivable network design with hop constraints problem
cites work: A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
DOI: 10.1016/J.COR.2017.10.005
Recommended article: A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
Recommended article: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
Recommended article: A branch-and-cut algorithm for two-level survivable network design problems
Recommended article: Branch and cut methods for network optimization
Recommended article: A branch-and-cut algorithm for capacitated network design problems
Recommended article: A branch and cut algorithm for the hierarchical network design problem
Recommended article: Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
Recommended article: Solution methods for the vertex variant of the network system vulnerability analysis problem
Recommended article: Design of survivable networks with vulnerability constraints
Recommended article: Cutset Inequalities for Robust Network Design
description: scientific article; zbMATH DE number 6901558