Author:
Bosch Robert A.,Anstreicher Kurt M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. K. M. Anstreicher, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm,Mathematical Programming,47 (1990), 337?351.
2. K. M. Anstreicher and R. A. Bosch, Long steps in anO(n 3 L) algorithm for linear programming,Mathematical Programming,54 (1992), 251?265.
3. D. den Hertog, C. Roos, and J.-Ph. Vial, A complexity reduction for the long-step path-following algorithm for linear programming,SIAM Journal on Optimization,2 (1992), 71?87.
4. R. M. 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.
5. C. C. Gonzaga, An algorithm for solving linear programming problems inO(n 3 L) operations, inProgress in Mathematical Programming (N. Megiddo, ed.), Springer-Verlag, Berlin, 1989, pp. 1?28.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献