A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints

DOI10.1287/ijoc.2018.0869zbMath1451.90024OpenAlexW2963443214MaRDI QIDQ5139851

Okan Arslan, Ola Jabali, Gilbert Laporte

Publication date: 11 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2018.0869

zbMATH Keywords

branch-and-cut algorithmvulnerabilitynetwork designsurvivabilitylength-bounded minimum cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (2)

Imposing Contiguity Constraints in Political Districting Models ⋮ Design of survivable wireless backhaul networks with reliability considerations

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• Design of survivable networks
• Mengerian theorems for paths of bounded length
• Multicommodity flow models for spanning trees with hop constraints
• Evolution and state-of-the-art in integer programming
• Branch-and-cut methods for the network design problem with vulnerability constraints
• Design of survivable networks with vulnerability constraints
• Polyhedral results for two-connected networks with bounded rings
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• A branch-and-cut algorithm for the k-edge connected subgraph problem
• Maximal Flow Through a Network
• Length-Bounded Cuts and Flows
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Solving the Two-Connected Network with Bounded Meshes Problem
• Solving Steiner tree problems in graphs to optimality
• Design of Survivable Networks: A survey

This page was built for publication: A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints