F. Granot;J. S. Kapov
-;-
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On simultaneous approximation in quadratic integer programming
Operations Research Letters