A strongly polynomial minimum cost circulation algorithm
Combinatorica
Efficient shortest path simplex algorithms
Operations Research
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and o(n2m) time
Mathematical Programming: Series A and B
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem
Mathematics of Operations Research
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Mathematical Programming: Series A and B
The scaling network simplex algorithm
Operations Research - Supplement
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Finding minimum-cost flows by double scaling
Mathematical Programming: Series A and B
A faster strongly polynomial minimum cost flow algorithm
Operations Research
A genuinely polynomial primal simplex algorithm for the assignment problem
Discrete Applied Mathematics
Polynomial dual network simplex algorithms
Mathematical Programming: Series A and B
A polynomial time primal network simplex algorithm for minimum cost flows
Mathematical Programming: Series A and B
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computational analysis of network optimization algorithms
Computational analysis of network optimization algorithms
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms
Journal of Intelligent and Robotic Systems
Emergent behaviour evolution in collective autonomous mobile robots
ICS'08 Proceedings of the 12th WSEAS international conference on Systems
Cross-Layer Optimized Call Admission Control in Cognitive Radio Networks
Mobile Networks and Applications
| Hi-index | 0.00 |