𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal interdiction of a supply network

✍ Scribed by Alan W. McMasters; Thomas M. Mustin


Publisher
John Wiley and Sons
Year
1970
Tongue
English
Weight
441 KB
Volume
17
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis


Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for miqimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.


πŸ“œ SIMILAR VOLUMES


A problem in network interdiction
✍ Bruce Golden πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 158 KB
Reformulation and sampling to solve a st
✍ Udom Janjarassuk; Jeff Linderoth πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 179 KB

## Abstract The network interdiction problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget constraint limits the amount of the network that can be destroyed. In this article, we study a stochastic version