Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum-cost flow problem. Upper bounds on the number of steps in these algorithms are derived, and are shown to improve on the upper bounds of earlier algorithms.
Unable to display preview. Download preview PDF.