Shortest path network interdiction is a combinatorial optimization problem on
an activity network arising in a number of important security-related
applications. It is classically formulated as a bilevel maximin problem
representing an "interdictor" and an "evader". The evader tries to move from a
source node to the target node along a path of the least cost while the
interdictor attempts to frustrate this motion by cutting edges or nodes.