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 compo...

A “project manager” wishes to complete a project (e.g., a weaponsdevelopment program) as quickly as possible. Using a limited interdiction budget, an “interdictor” wishes to delay the project’s overall completion time by interdicting and thereby delaying some of the project’s component tasks. We explore a variety of PERT-based interdiction models for such problems and show that the resulting pr...

The purpose of the independent set interdiction problem in the weighted graph G is to determine a set of vertices R∗ such that the weight of the maximum independent set in G−R∗ is minimized. We define an approximate solution for this problem. Then, an upper bound for the relative error of this problem is obtained. We show that the limit of the relative error of the independent set interdiction ...

We study the two player zero-sum Stackelberg game in which the leader interdicts (removes) a limited number of vertices from the graph, and the follower searches for the maximum clique in the interdicted graph. The goal of the leader is to derive an interdiction policy which will result in the worst possible outcome for the follower. This problem has applications in many areas, such as crime de...

We study a shortest-path interdiction problem in which the interdictor acts first to lengthen subset of arcs, and an evader second select shortest path across network. In this problem, cost for evader’s arc consists base if is not interdicted, plus additional that incurred interdicted. The aware costs when action taken, but does know values are uniformly distributed within given (arc-specific) ...

Network interdiction can be viewed as a game between two players, an interdictor and a flow player. The flow player wishes to send as much material as possible through a network, while the interdictor attempts to minimize the amount of transported material by removing a certain number of arcs, say Γ arcs. We introduce the randomized network interdiction problem that allows the interdictor to us...