Abstract
M. Minoux considered the maximum balanced flow problem, which is a maximum flow problem with an additional constraint described in terms of a balancing rate function. In this paper, we propose an algorithm for the maximum balanced flow problem which is practically fast and simple. When the balancing rate function is constant, the proposed algorithm requires O(mT(n,m)) time, where T(n,m) is the time for the maximum flow computation for a network with n vertices and m arcs.
