The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
We introduce an algorithm that solves the maximum flow problem without generating flows explicitly. The algorithm solves di- rectly a problem we call the maximum s-excess problem. That problem is equivalent to the minimum cut problem, and is a direct extension of the maximum closure problem. The concepts used also lead to a new parametric analysis algorithm generating all breakpoints in the amount of time of a single run.
The insights derived from the analysis of the new algorithm lead to a new simplex algorithm for the maximum flow problem — a pseudoflow-based simplex. We show that this simplex algorithm can perform a parametric analysis in the same amount of time as a single run. This is the first known simplex algorithm for maximum flow that generates all possible breakpoints of parameter values in the same complexity as required to solve a single maximum flow instance and the fastest one.
The complexities of our pseudoflow algorithm, the new simplex algo- rithm, and the parametric analysis for both algorithms are O(mnlog n) on a graph with n nodes and m arcs.
KeywordsSink Node Extended Network Simplex Algorithm Balance Constraint Maximum Flow Problem
Unable to display preview. Download preview PDF.
- GC96.D. Goldfarb and W. Chen. On strongly polynomial dual algorithms for the maximum flow problem. Special issue of Mathematical Programming B, 1996. To appear.Google Scholar
- Hoc96.D. S. Hochbaum. A new — old algorithm for minimum cut on closure graphs. Manuscript, June 1996.Google Scholar
- LG64.H. Lerchs, I. F. Grossmann. Optimum design of open-pit mines. Transactions, C.I.M., LXVIII:17–24, 1965.Google Scholar