Like a Porsche racing a horse-drawn carriage The ETH Zurich researchers have thus developed what is, in theory, the fastest possible network flow algorithm.

Computer scientists at ETH Zurich have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum ...

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.

Introduction to mathematical optimization and its applications, linear optimization models, Simplex Algorithm, sensitivity analysis, mixed-integer optimization models, branch-and-bound algorithm, ...

Richard M. Karp, Rajeev Motwani, Noam Nisan, Probabilistic Analysis of Network Flow Algorithms, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 ...

The network flow model provides a lower bound and a nearly feasible solution that can be made feasible with some simple heuristics. Our algorithm is fast and has performed well on a set of more than ...