Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Efficient algorithms for the Hitchcock transportation problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A fully combinatorial algorithm for submodular function minimization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A fully combinatorial algorithm for submodular function minimization
Journal of Combinatorial Theory Series B
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A dual version of tardos's algorithm for linear programming
Operations Research Letters
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
Operations Research
| Hi-index | 0.00 |