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