## Date of Graduation

5-2015

## Document Type

Thesis

## Degree Name

Bachelor of Science in Industrial Engineering

## Degree Level

Undergraduate

## Department

Industrial Engineering

## Advisor/Mentor

Sullivan, Kelly M

## Abstract

We consider a variant to the shortest path network interdiction problem with symmetric information from Israeli and Wood (Networks 40, 97-111,2002) which arises in the context of nuclear smuggling prevention. In the basic shortest path interdiction problem, an interdictor has a limited number of interdictions with which he can lengthen arcs in a network in order to maximize the length of the network’s shortest path. This thesis considers the case in which the interdictor does not make all of the interdictions at once. Rather, the interdictor must make the interdictions over a set number of periods. Each period has a budget for the number of interdictions that can be placed during the period. The interdictor must prioritize the interdictions and decide the order in which the interdictions should take place. This problem is formulated as an integer program with an objective to maximize the average of the shortest paths across all periods.

## Citation

Summerhill, H. D.
(2015). Prioritizing Interdictions on a Shortest Path Network. * Industrial Engineering Undergraduate Honors Theses*
Retrieved from https://scholarworks.uark.edu/ineguht/33