A strongly polynomial algorithm to solve combinatorial linear programs
Operations Research
Introduction to algorithms
Combinatorial algorithms for the generalized circulation problem
Mathematics of Operations Research
A strongly polynomial algorithm for a special class of linear programs
Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
American Mathematical Monthly
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing
New algorithms for generalized network flows
Mathematical Programming: Series A and B
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Mathematics of Operations Research
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster approximation algorithms for generalized flow
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A epsilon-Relaxation Method for Generalized Separable Convex Cost Network Flow Problems
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Faster approximation algorithms for generalized flow
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cycles in Generalized Networks
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |