A problem in network interdiction

Bruce Golden

Naval Research Logistics Quarterly, 1978, vol. 25, issue 4, 711-713

Abstract: Suppose we are given a network G=(V,E) with arc distances and a linear cost function for lengthening arcs. In this note, we consider a network‐interdiction problem in which the shortest path from source node s to sink node t is to be increased to at least τ units via a least‐cost investment strategy. This problem is shown to reduce to a simple minimum‐cost‐flow problem. Applications and generalizations are discussed, including the multiple‐destination case.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (22)

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

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:25:y:1978:i:4:p:711-713

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 ().