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 ...

To tackle the problem, researchers have traditionally used a maximum-flow algorithm, also known as “max flow,” in which a network is represented as a graph with a series of nodes, known as ...

With Kin's algorithm, all important network flow problems, including maximum flow and minimum cost problems, can now be treated as special cases of the minimum cost flow problem.

An algorithm promises to greatly streamline solutions to the "max flow" problem.

The maximum ow solver is di fficult to parallelize. Highly optimized sequential version of maximum flow solvers such as those by Goldberg exists. This work describes how some of the concurrency ...

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 ...

Algorithm promises to greatly streamline solutions to the 'max flow' problem. Research could boost the efficiency even of huge networks like the Internet. Finding the most efficient way to ...

We develop a new approach to solving minimum-cost circulation problems. Our approach combines methods for solving the maximum flow problem with successive approximation techniques based on cost ...