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

We develop several algorithms for the simple equal flow problem-the network simplex algorithm, the parametric simplex algorithm, the combinatorial parametric algorithm, the binary search algorithm, ...

Our algorithms are based on the successive shortest-path algorithm for the minimum cost flow problem. We exploit the special structure of the problem and use advanced data structures, when required, ...

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

A new algorithm has shown in simulations that traffic jams can be considerably reduced — even if just 10 percent of cars on the road follow its guidelines.

If integrated into adaptive cruise-control systems, a new algorithm could mitigate the type of freeway backup that seems to occur for no reason.