A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems
Optimization Methods & Software
Hi-index | 0.00 |