Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives.

Lszl A. Vgh

Browse the full STOC paper archive.