Author:
Bertsimas Dimitris,Luo Xiaodong
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference19 articles.
1. K.M. Anstreicher, The worst-case step in Karmarkar’s algorithm,Mathematics of Operations Research 14 (1989) 295–302.
2. K.M. Anstreicher, On the performance of Karmarkar’s algorithm over a sequence of iterations,SIAM Journal on Optimization 1 (1991) 22–29.
3. R. Freund, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,Mathematical Programming 51 (1991) 203–222.
4. C.C. Gonzaga, An algorithm for solving linear programming problems in O(n 3 L) operations, in: N. Megiddo, ed.,Progress in Mathematical Programming. Interior Point and Related Methods (Springer, New York, 1988) 1–28.
5. C.C. Gonzaga and M.J. Todd, An O(√nL)-iteration large-step primal-dual affine algorithm for linear programming,SIAM Journal on Optimization 2 (1992) 349–359.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献