Algorithm promises to greatly streamline solutions to the 'max flow' problem.

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

Richard M. Karp, Rajeev Motwani, Noam Nisan, Probabilistic Analysis of Network Flow Algorithms, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 ...

Rasmus Kyng has written the near-perfect algorithm. It computes the maximum transport flow at minimum cost for any kind of network – be it rail, road or electricity – at a speed that is, ...