The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
From MaRDI portal
Publication:2270321
DOI10.1016/j.orl.2009.09.013zbMath1182.90014OpenAlexW2092890945MaRDI QIDQ2270321
Özlem Ergun, Nelson A. Uhan, Douglas S. Altner
Publication date: 18 March 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.09.013
Related Items (35)
Minimum cost edge blocker clique problem ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Exact and approximation algorithms for sensor placement against DDoS attacks ⋮ Minimum edge blocker dominating set problem ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction ⋮ Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ On designing networks resilient to clique blockers ⋮ Interdiction problems on planar graphs ⋮ Unnamed Item ⋮ An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach ⋮ Recovery strategies from major supply disruptions in single and multiple sourcing networks ⋮ Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers ⋮ An exact approach for the \(r\)-interdiction covering problem with fortification ⋮ Protection of flows under targeted attacks ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance ⋮ Bilevel model for adaptive network flow problem ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications ⋮ A computational approach to determine damage in infrastructure networks from outage reports ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Perfect matching interdiction problem restricted to a stable vertex ⋮ A survey of network interdiction models and algorithms ⋮ Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic network interdiction
- Stochastic Network Interdiction
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Reformulation and sampling to solve a stochastic network interdiction problem
- Finding the n Most Vital Links in Flow Networks
- Shortest-path network interdiction
- The network inhibition problem
- The maximum residual flow problem: NP‐hardness with two‐arc destruction
- Optimal interdiction of a supply network
- On the history of the transportation and maximum flow problems
This page was built for publication: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
