A strongly polynomial minimum cost circulation algorithm
Combinatorica
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
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Finding Minimum-Cost Flows by Double-Scaling
Finding Minimum-Cost Flows by Double-Scaling
Book review: Potokovye Algoritmy (Flow Algorithms) by G. M. Adel''son-Vel''ski, E. A. Dinic, and A. V. Karzanov.
Minimizing capacity violations in a transshipment network
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Polynomial methods for separable convex optimization in unimodular spaces
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |