Note on Weintraub's minimum-cost circulation algorithm

Finding minimum-cost circulations by canceling negative cycles

Journal of the ACM (JACM)

A polynomial combinatorial algorithm for generalized minimum cost flow

STOC '99 Proceedings of the thirty-first 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

Maximum utility product pricing models and algorithms based on reservation price

Computational Optimization and Applications

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

Operations Research Letters

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

Operations Research Letters