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

This paper presents an innovative approach to maximally disconnect a given network. More specifically, this work introduces the concept of a critical disruption path, a path between a source and a destination vertex whose deletion minimizes the cardinality of the largest remaining connected component. Network interdiction models seek to optimally disrupt network operations. Existing interdictio...

In a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, while an interdictor endeavors to maximize the project duration by delaying some of the project tasks. We formulate static and dynamic versions of the interdictor’s decision problem where the interdiction plan is either pre-committed or adapts to new information reve...

This paper advances the field of network interdiction analysis by introducing an application to the urban rail transit network, deploying protective resources against intentional attacks. The resource allocation problem for urban rail transit systems is considered as a game between two players, the attacker interdicting certain rail stations to generate greatest disruption impact and the system...

THE JOINT surveillance and target attack radar system (JSTARS) promises to revolutionize how US forces conduct conventional warfare. Before the development of JSTARS, US forces de­ pended on close operations to defeat an enemy army. Because airpower’s ability to destroy an enemy’s mo­ bile ground forces was severely limited, especially during darkness and bad weather, interdiction proved import...

We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget. We formulate this bilevel, max–min problem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decomposition a...

Using limited assets, an interdictor attempts to destroy parts of a capacitated network through which an adversary will subsequently maximize flow. We formulate and solve a stochastic version of the interdictor’s problem: Minimize the expected maximum flow through the network when interdiction successes are binary random variables. Extensions are made to handle uncertain arc capacities and othe...

This paper develops an incentives-based theory of policing that can explain the phenomenon of random “crackdowns,” which are intermittant periods of especially high interdiction/surveillance. We show that, when police minimize the crime rate, random crackdowns can emerge as part of an optimal policing strategy. We consider several variations of the basic policing model that would apply in diffe...

vii

In this paper, a novel approach to behavioural modelling is presented with reference to biological infection spread in communities. Its potential application to various terrorist-related scenarios is discussed in relation to attack point simulation and interdiction simulation.