On strongly polynomial dual simplex algorithms for the maximum flow problem

Abstract

Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow problem on an n-node, m-arc network in at most 2nm pivots and O(n 2 m) time are presented. These rules are based on the concept of a preflow and depend upon the use of node labels which are either the lengths of a shortest pseudoaugmenting path from those nodes to the sink node or valid underestimates of those lengths. Extended versions of our algorithms are shown to solve an important class of parametric maximum flow problems with no increase in the worst-case pivot and time bounds of these algorithms.