Linear programming in O(n × 3d2) time

Information Processing Letters - Tập 22 - Trang 21-24 - 1986
Kenneth L. Clarkson1,2
1AT&T Bell Laboratories, Murray Hill, NJ 07974, U.S.A.
2Present affiliation: Computer Science Department, Stanford University, Stanford, CA 94305, U.S.A.

Tài liệu tham khảo

M.E. Dyer, On a multidimensional search technique and its application to the Euclidean one-centre problem, Unpublished manuscript. Karmarkar, 1984, A new polynomial-time algorithm for linear programming Khachian, 1979, A polynomial algorithm for linear programming, Dokl. Acad. Nauk SSSR, 244, 1093 Megiddo, 1984, Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach., 31, 114, 10.1145/2422.322418