Credible Interdiction for Transmission Systems

This paper presents novel formulations and algorithms for $N$-$k$ interdiction problem in transmission networks. In particular, it formulates spatial topological resource constraints on attackers problems illustrates the formulation with two new classes of attacks: (i) Spatial attacks where attack is constrained by geographic distance a bus chosen an attacker (ii) Topological to connected components. These specific types compute plans designed better model localized attacks, such as those induced natural disasters or physical attacks. We then formulate these resource-constrained bilevel, max-min optimization present constraint generation algorithm solve formulations. Detailed case studies analyzing behavior spatially topologically comparing them traditional are also presented.