A polynomial time primal network simplex algorithm for minimum cost flows
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
On sub-determinants and the diameter of polyhedra
Proceedings of the twenty-eighth annual symposium on Computational geometry
A strongly polynomial simplex method for the linear fractional assignment problem
Operations Research Letters
A network simplex algorithm with O(n) consecutive degenerate pivots
Operations Research Letters
Finding short paths on polytopes by the shadow vertex algorithm
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |