Ahuja, Ravindra K.; Orlin, James B.; Sechi, Giovanni M.; … - In: Management Science 45 (1999) 10, pp. 1440-1455
The minimum cost flow problem is to determine a least cost shipment of a commodity through a network G = (N, A) in … minimum cost flow problem where we are given a set R \subseteq A of arcs and require that each arc in R must carry the same …(log(nU)) applications of any minimum cost flow algorithm. The capacity scaling algorithm solves it in O(m(m + n logn) log (nU)) time, which …