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

A team of researchers led by Rasmus Kinn of the Swiss Federal Institute of Technology in Zurich has created a near-perfect algorithm to calculate the maximum transport flows at the lowest cost in any ...

This is a preview. Log in through your library . Abstract The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos [1985] and is based ...