Optimal interdiction policy for a flow network

P. M. Ghare, D. C. Montgomery and W. C. Turner

Naval Research Logistics Quarterly, 1971, vol. 18, issue 1, 37-45

Abstract: This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
https://doi.org/10.1002/nav.3800180103

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:18:y:1971:i:1:p:37-45

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().