Two strongly polynomial cut cancelling algorithms for minimum cost network flow

Polynomial methods for separable convex optimization in unimodular spaces

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

On dual minimum cost flow algorithms (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Approximate binary search algorithms for mean cuts and cycles

Operations Research Letters

Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

Operations Research Letters

An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem

Theoretical Computer Science