Heng Cao, Haifeng Xi, et al.
WSC 2003
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.
Heng Cao, Haifeng Xi, et al.
WSC 2003
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings