Optimal interdiction policy for a flow network
From MaRDI portal
Cited in
(38)- Exact algorithms for the minimum cost vertex blocker clique problem
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
- Connectivity interdiction
- Deterministic network interdiction
- Equilibrium strategies for multiple interdictors on a common network
- The continuous maximum capacity path interdiction problem
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Convex hull representation of the deterministic bipartite network interdiction problem
- A survey of network interdiction models and algorithms
- An exact solution approach for the interdiction median problem with fortification
- Integer programming methods for solving binary interdiction games
- Minimizing a stochastic maximum-reliability path
- Minimum edge blocker dominating set problem
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Sequential Shortest Path Interdiction with Incomplete Information
- Multilevel approaches for the critical node problem
- Symmetric interdiction for matching problems
- A unified framework for multistage mixed integer linear optimization
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Analysis of budget for interdiction on multicommodity network flows
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- On designing networks resilient to clique blockers
- Attack and interception in networks
- Computation of Nash equilibria of attack and defense games on networks
- Disconnectedness brings robustness? On network design for matching with vertex interdiction
- Optimal sequential stochastic shortest path interdiction
- Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints
- On supervalid inequalities for binary interdiction games
- An FPTAS for connectivity interdiction
- The multi-terminal maximum-flow network-interdiction problem
- An FPTAS for connectivity interdiction
- Minimum cost edge blocker clique problem
- Interdiction problems on planar graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
This page was built for publication: Optimal interdiction policy for a flow network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5620466)
