Introduction Over the past decade, decapitation, particularly high-value targeting (HVT), has come into vogue and is being increasingly applied in a variety of counterterrorism, counterinsurgency, and anti-organized crime settings around the world. There are several reasons for this widespread adoption of high-value targeting as a dominant interdiction pattern. First, there is a long tradition ...

Network interdiction refers to disrupting a network in an attempt to either analyze the network’s vulnerabilities or to undermine a network’s communication capabilities. A vast majority of the works that have studied network interdiction assume a priori knowledge of the network topology. However, such knowledge may not be available in real-time settings. For instance, in practical electronic wa...

We describe and compare heuristic solution methods for a multi-stage stochastic network interdiction problem. The problem is to maximize the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain. In this formulation, interdiction subject to a budget constraint is followed by operation of the network, which is then followed by...

Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general networks, pseudo-polynomial algorithms were found for planar networks with a single source and a single sink and without the possibility to remove vertices. In ...

A “proliferator” seeks to complete a first small batch of fission weapons as quickly as possible, whereas an “interdictor” wishes to delay that completion for as long as possible. We develop and solve a max-min model that identifies resourcelimited interdiction actions that maximally delay completion time of the proliferator’s weapons project, given that the proliferator will observe any such a...

the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...

Interdiction operations involving search, identification, and interception of suspected objects are of great interest and high operational importance to military and naval forces as well as nation’s coast guards and border patrols. The interdiction scenario discussed in this paper includes an area of interest with multiple neutral and hostile objects moving through this area, and an interdictio...

This paper introduces interdiction branching, a new branching method for binary integer programs that is designed to overcome the difficulties encountered in solving problems for which branching on variables is inherently weak. Unlike traditional methods, selection of the disjunction in interdiction branching takes into account the best feasible solution found so far. In particular, the method ...