Operations Research · 2005 · 167 citations · 11 references
ComputingComputer ScienceDecision SciencesComputer SecurityOptimizationSecurity StudiesDefense PlanningMilitary SecurityThreat ModelingAttack MitigationDeception In Missile ControlDefensive DeceptionDefensive OperationsDefensive StrategyOptimal Control For Missiles
We present JOINT DEFENDER, a two‑sided optimization framework for planning the pre‑positioning of defensive missile interceptors to counter an attack threat. The model pre‑positions ballistic missile defense platforms to minimize worst‑case damage under full information, with variants that restrict attacker and/or defender knowledge to study the value of secrecy. In realistic scenarios, the framework evaluates transparent exchanges in minutes on a laptop and produces near‑optimal secret defenses in seconds, providing computational efficiency and new insights into secrecy and deception, as demonstrated in two North Korean case studies.
We describe JOINT DEFENDER, a new two-sided optimization model for planning the pre-positioning of defensive missile interceptors to counter an attack threat. In our basic model, a defender pre-positions ballistic missile defense platforms to minimize the worst-case damage an attacker can achieve; we assume that the attacker will be aware of defensive pre-positioning decisions, and that both sides have complete information as to target values, attacking-missile launch sites, weapon system capabilities, etc. Other model variants investigate the value of secrecy by restricting the attacker’s and/or defender’s access to information. For a realistic scenario, we can evaluate a completely transparent exchange in a few minutes on a laptop computer, and can plan near-optimal secret defenses in seconds. JOINT DEFENDER’s mathematical foundation and its computational efficiency complement current missile-defense planning tools that use heuristics or supercomputing. The model can also provide unique insight into the value of secrecy and deception to either side. We demonstrate with two hypothetical North Korean scenarios.
11
Anthony Brook, David A. Kendrick, Alexander Meeraus · ACM SIGNUM Newsletter · 1988 · 3K citations
Deterministic network interdiction
R. Kevin Wood · Mathematical and Computer Modelling · 1993 · 613 citations
Shortest‐path network interdiction
Eitan Israeli, R. Kevin Wood · Networks · 2002 · 520 citations