An Exact Algorithm for Solving the Fortification Problem under Scenario Uncertainty

The fortification problem (FP) is commonly formulated as a defender-attacker-defender (DAD) model. In this setting, a planner first hardens up to h components, then an attacker interdicts up to k components, and finally the defender solves a recourse problem to maintain system operations. A key limitation of the DAD model is the assumption that the … Read more

Faster Solutions to the Interdiction Defense Problem using Suboptimal Solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. We build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that … Read more