Shortest path network interdiction with incomplete information: a robust optimization approach

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Methods for removing links in a network to minimize the spread of infections
Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
Stochastic maximum flow interdiction problems under heterogeneous risk preferences
An implicit enumeration algorithm for the hub interdiction median problem with fortification
Deterministic network interdiction
The stochastic interdiction median problem with disruption intensity levels
Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure
Network interdiction with asymmetric cost uncertainty
A survey of network interdiction models and algorithms
Integer programming methods for solving binary interdiction games
Stochastic network interdiction
Interdicting a Nuclear-Weapons Project
Minimizing a stochastic maximum-reliability path
Shortest path network interdiction with asymmetric information
The Price of Robustness
Securing a border under asymmetric information
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
Deception tactics for network interdiction: A multiobjective approach
Sequential Shortest Path Interdiction with Incomplete Information
Shortest-path network interdiction
Sequential Interdiction with Incomplete Information and Learning
The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
Integer Programming Formulations for Minimum Spanning Tree Interdiction