← Search

Removing Arcs from a Network

Richard Wollmer

Operations Research Center, University of California, Berkeley

Operations Research 1964

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.

DOI
10.1287/opre.12.6.934
Volume
12 (6)
Pages
934-940
Language
en
Export
BibTeX
Sources
crossref