Author:
Kojima Masakazu,Mizuno Shinji,Yoshise Akiko
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference27 articles.
1. J.R. Birge and A. Gana, “Computational complexity of van der Heyden's variable dimensional algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's,”Mathematical Programming 26 (1983) 316–325.
2. S.J. Chung, “A note on the complexity of LCP: the LCP is strongly NP-complete,” Technical Report 792, Dept. of Industrial Engineering and Operations Engineering, The University of Michigan (Ann Arbor, Michigan, 1979).
3. G.B. Dantzig and R.W. Cottle, “Positive (semi-definite) matrices and mathematical programming,” Report ORC 63-18, (RR) 13, University of Berkeley (California, 1963).
4. Y. Fathi, “Computational complexity of LCPs associated with positive definite symmetric matrices,”Mathematical Programming 17 (1979) 335–344.
5. D.M. Gay, “A variant of Karmarkar's linear programming algorithm for problems in standard form,”Mathematical Programming 37 (1987) 81–90.
Cited by
272 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献