Removing Arcs from a Network

Richard Wollmer
Additional contact information
Richard Wollmer: Operations Research Center, University of California, Berkeley

Operations Research, 1964, vol. 12, issue 6, 934-940

Abstract: This paper proposes an algorithm for making a sensitivity analysis on a flow network, specifically, the problem of removing n arcs in a network such that the reduction in the maximum flow between an origin and destination node is maximized. Such an algorithm might be helpful in determining how sensitive a transportation system is to having its roads closed for repairs.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (60)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.6.934 (application/pdf)

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:inm:oropre:v:12:y:1964:i:6:p:934-940

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().