Network Interdiction Models
Abstract
Two mathematical programs are developed which determine strategies to interdict a network using limited resources. The first model identifies a set of arcs whose interdiction minimizes the maximum flow through the network, constrained by the available resources. The solution is a set of segments to interdict and a set of segments which are not interdicted, but determine the maximum flow in the interdicted network. The second model identifies a set of arcs whose interdiction isolates a targeted demand node and a maximum number of contiguous nodes about this specified node. This model is developed to take into account that the exact location of the demand node may not be known with certainty. The models are applied to a sample network that is similar to a river and road network in Bolivia where counter-narcotic interdiction operations are being conducted to stop the flow of precursor chemicals needed to manufacture cocaine. Insights drawn from the models' solutions are discussed.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1991
- Accession Number
- ADA245778
Entities
People
- Robert L. Steinrauf
Organizations
- Naval Postgraduate School