A dynamic network interdiction problem
From MaRDI portal
Publication:3098533
zbMATH Open1229.91093MaRDI QIDQ3098533FDOQ3098533
Authors: Brian J. Lunday, Hanif D. Sherali 
Publication date: 17 November 2011
Recommendations
resource allocationnetwork interdictiondynamic formulationminimax flow problemsalternating heuristic
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Applications of game theory (91A80) Mixed integer programming (90C11)
Cited In (17)
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Optimal Interdiction of Unreactive Markovian Evaders
- Heuristics for multi-stage interdiction of stochastic networks
- Wireless LAN transmitter location under the threat of jamming attacks
- Dynamic network interdiction problem with uncertain data
- 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
- Deterministic network interdiction
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- A survey of network interdiction models and algorithms
- Interdicting restructuring networks with applications in illicit trafficking
- Bi-objective optimization models for network interdiction
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Solving multi-period interdiction via generalized Bender's decomposition
- Deception tactics for network interdiction: a multiobjective approach
- Dynamic shortest-path interdiction
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
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)
