Finding the n Most Vital Links in Flow Networks

H. Donald Ratliff, G. Thomas Sicilia and S. H. Lubore
Additional contact information
H. Donald Ratliff: University of Florida
G. Thomas Sicilia: U.S. Army Military Personnel Center, Alexandria, Virginia
S. H. Lubore: The Mitre Corporation, McLean, Virginia

Management Science, 1975, vol. 21, issue 5, 531-539

Abstract: The n most vital links of a flow network are defined as those n arcs whose simultaneous removal from the network causes the greatest decrease in the throughput capability of the remaining system between a specified pair of nodes. These n arcs are shown to be the n largest capacity arcs in a particular cut. A solution procedure is developed which involves sequentially modifying the network so as to make this cut eventually become the cut with smallest capacity. An algorithm with computational results is presented.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.5.531 (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:ormnsc:v:21:y:1975:i:5:p:531-539

Access Statistics for this article

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