Heuristics for Multi-Stage Interdiction of Stochastic Networks
Journal of Heuristics
Lifetime-aware intrusion detection under safeguarding constraints
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
The "BEST" algorithm for solving stochastic mixed integer programs
Proceedings of the 38th conference on Winter simulation
Defending Critical Infrastructure
Interfaces
Defending Critical Infrastructure
Interfaces
Survivable network design under optimal and heuristic interdiction scenarios
Journal of Global Optimization
A bilevel mixed-integer program for critical infrastructure protection planning
Computers and Operations Research
Computers and Operations Research
Network flow interdiction on planar graphs
Discrete Applied Mathematics
A bi-objective approach for shortest-path network interdiction
Computers and Industrial Engineering
A graph-theoretic approach to protect static and moving targets from adversaries
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
How to protect a city: strategic security placement in graph-based domains
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
SPAR: stochastic programming with adversarial recourse
Operations Research Letters
Operations Research Letters
Computing optimal security strategies in networked domains: a cost-benefit approach
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
The r-interdiction median problem with probabilistic protection and its solution algorithm
Computers and Operations Research
Maximum dynamic network flow interdiction problem: New formulation and solution procedures
Computers and Industrial Engineering
Computers and Operations Research
Protection issues for supply systems involving random attacks
Computers and Operations Research
Hi-index | 0.00 |
Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor's problem: Minimize the expected maximum flow through the network when interdiction successes are binary random variables. Extensions are made to handle uncertain arc capacities and other realistic variations. These two-stage stochastic integer programs have applications to interdicting illegal drugs and to reducing the effectiveness of a military force moving materiel, troops, information, etc., through a network in wartime. Two equivalent model formulations allow Jensen's inequality to be used to compute both lower and upper bounds on the objective, and these bounds are improved within a sequential approximation algorithm. Successful computational results are reported on networks with over 100 nodes, 80 interdictable arcs, and 180 total arcs.