A dynamic network interdiction problem

zbMATH Open1229.91093MaRDI QIDQ3098533FDOQ3098533

Authors: Brian J. Lunday, Hanif D. Sherali 

Publication date: 17 November 2011

Recommendations

• Dynamic network interdiction problem with uncertain data
• Dynamic shortest-path interdiction
• Network interdiction with asymmetric cost uncertainty
• Optimal Interdiction of Unreactive Markovian Evaders
• Deterministic network interdiction

zbMATH Keywords

resource allocationnetwork interdictiondynamic formulationminimax flow problemsalternating heuristic

Mathematics Subject Classification ID

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 (10)

• 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
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• Deterministic network interdiction
• A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
• Interdicting restructuring networks with applications in illicit trafficking
• Network interdiction through length-bounded critical disruption paths: a bi-objective approach
• Deception tactics for network interdiction: a multiobjective approach

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)