Modeling strategic strikes against transportation networks.
Wood, R. Kevin
MetadataShow full item record
We present deterministic and probabilistic models for the analysis of strategic strikes against transportation networks. The deterministic models use integer programming to solve problems on single and multicommodity networks. The aims of a network interdictor are (a) to minimize the maximum network flow with a fixed amount of interdiction resources, or (b) to minimize the total effort and mission turnaround time if given sufficient resources to stop the flow completely. In the case of a multicommodity network, the interdictor also aims to utilize minimum resources to achieve a disconnecting set which severs the paths connecting all sources to their respective sinks. In the probabilistic model, arc capacity is not a factor and the objective of a single interdictor is to minimize the probability of infiltration by a single evader through a network while the objective of the evader is just the opposite.
RightsCopyright is reserved by the copyright owner
Showing items related by title, author, creator and subject.
Boyle, Michael R. (Monterey, California. Naval Postgraduate School, 1998-03);In the network interdiction problem, an interdictor destroys a set of arcs in a capacitated network through which an adversary will maximize flow. The interdictor's primary objective is to use his limited resources to ...
Akgün, Ibrahim; Tansel, Barbaros Ç.; Wood, R. Kevin (2021);This paper defines and studies the multi-terminal maximum-flow network-interdiction problem (MTNIP) in which a network user attempts to maximize flow in a network among K P 3 pre-specified node groups while an interdictor ...
Allain, Richard J. (Monterey, California: Naval Postgraduate School, 2016-06);We propose a novel network interdiction model that reconciles many operational realities identified by military literature. Specifically, we conduct network interdiction within a dynamic network under partial information, ...