More information: Li Chen et al, Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow, Proceedings of the 56th Annual ACM Symposium ...

It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are ...

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

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several ...