Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...