>minimum cost flow</a> <a class="el" href="a00638.html#CITEREF_amo93networkflows">[1]</a>, <a class="el" href="a00638.html#CITEREF_edmondskarp72theoretical">[12]</a>. It is an efficient dual solution method, which runs in polynomial time <img class="formulaInl" alt="$O(m\log U (n+m)\log n)$" src="form_56.png"/>, where <em>U</em> denotes the maximum of node supply and arc capacity values.</p>
<p>This algorithm is typically slower than <a class="el" href="a00109.html">CostScaling</a> and <a class="el" href="a