A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
A strongly polynomial simplex method for the linear fractional assignment problem
Operations Research Letters
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Operations Research Letters
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
Operations Research Letters
| Hi-index | 0.00 |