Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
It has been a challenge for mathematicians to theoretically confirm the extremely good performance of simplex algorithms for linear programming. We have confirmed that a certain variant of the simplex method solves problems of order m × n in an expected number of steps which is bounded between two quadratic functions of the smaller dimension of the problem. Our probabilistic assumptions are rather weak. © 1984 American Mathematical Society.
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
J. LaRue, C. Ting
Proceedings of SPIE 1989
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989