The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
From MaRDI portal
Publication:2270321
DOI10.1016/J.ORL.2009.09.013zbMATH Open1182.90014OpenAlexW2092890945MaRDI QIDQ2270321FDOQ2270321
Ö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
Recommendations
- Two extended formulations for cardinality maximum flow network interdiction problem
- Hardness and approximation for network flow interdiction
- Approximation algorithm for maximum flow network interdiction problem
- Deterministic network interdiction
- The multi-terminal maximum-flow network-interdiction problem
Cites Work
- Title not available (Why is that?)
- Deterministic network interdiction
- Stochastic network interdiction
- Reformulation and sampling to solve a stochastic network interdiction problem
- Finding the n Most Vital Links in Flow Networks
- Shortest-path network interdiction
- Solving the bi-objective maximum-flow network-interdiction 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
- The network inhibition problem
- Title not available (Why is that?)
Cited In (40)
- Minimum cost edge blocker clique problem
- Exact and approximation algorithms for sensor placement against DDoS attacks
- An exact approach for the \(r\)-interdiction covering problem with fortification
- Protection of flows under targeted attacks
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- The continuous maximum capacity path interdiction problem
- Bilevel model for adaptive network flow problem
- The all-pairs vitality-maximization (VIMAX) 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
- Exact algorithms for the minimum cost vertex blocker clique problem
- Title not available (Why is that?)
- How vulnerable is an undirected planar graph with respect to max flow
- Minimum edge blocker dominating set problem
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- A survey of network interdiction models and algorithms
- Optimizing dynamic investment decisions for railway systems protection
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Interdiction problems on planar graphs
- How vulnerable is an undirected planar graph with respect to max flow
- Perfect matching interdiction problem restricted to a stable vertex
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
- An iterative security game for computing robust and adaptive network flows
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut
- On designing networks resilient to clique blockers
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
- Hardness and approximation for network flow interdiction
- Title not available (Why is that?)
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- Two-stage nodal network interdiction under decision-dependent uncertainty
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Recovery strategies from major supply disruptions in single and multiple sourcing networks
- A computational approach to determine damage in infrastructure networks from outage reports
This page was built for publication: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270321)
