A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n:::2:::m) Time

Donald Goldfarb, Jianxiu Hao. A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n:::2:::m) Time. Math. Program., 47:353-365, 1990.

Abstract

Abstract is missing.