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

This paper presents two new scaling algorithms for the minimum cost network flow problem, one a primal cycle canceling algorithm, the other a dual cut canceling algorithm. Both algorithms scale a ...