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

Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.

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

Barrie M. Baker, A Network-Flow Algorithm for Project Selection, The Journal of the Operational Research Society, Vol. 35, No. 9 (Sep., 1984), pp. 847-852 ...