The solution technique includes a maximal-flow procedure and produces a 'min-cut equals max-flow' theorem for networks with gains. Additional features, such as piece-wise linear convex costs, ...

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...