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

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

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

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

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

DIMITRIS BERTSIMAS, SARAH STOCK PATTERSON, The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach, Transportation Science, Vol. 34, No. 3 (August 2000), ...