A dynamic network interdiction problem
From MaRDI portal
Recommendations
Cited in
(21)- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Wireless LAN transmitter location under the threat of jamming attacks
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Deterministic network interdiction
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- A survey of network interdiction models and algorithms
- Solving multi-period interdiction via generalized Bender's decomposition
- Heuristics for multi-stage interdiction of stochastic networks
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Optimal Interdiction of Unreactive Markovian Evaders
- Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
- Exact algorithms and bounds for the dynamic assignment interdiction problem
- Dynamic shortest-path interdiction
- Deception tactics for network interdiction: a multiobjective approach
- Dynamic network interdiction problem with uncertain data
- Bi-objective optimization models for network interdiction
- Interdicting restructuring networks with applications in illicit trafficking
- A two‐stage network interdiction‐monitoring game
- Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks
- Stability of interdiction strategies in quickest flow networks
- A multi-objective, bilevel programming methodology to identify spatiotemporal transportation distribution network vulnerabilities
This page was built for publication: A dynamic network interdiction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098533)
