Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Economics, Econometrics and Finance (miscellaneous)
Reference26 articles.
1. Al-Kurdi, A., & Kincaid, R. D. (2006). LU decomposition with iterative refinement for solving sparse linear systems. Journal of Computational and Applied Mathematics, 185(2), 391–403.
2. Amin, G. R., & Toloo, M. (2004). A polynomial-time algorithm for finding $$\varepsilon $$ ε in DEA models. Computer & Operation Research, 31, 803–805.
3. Banker, R. D., Charnes, A., & Cooper, W. W. (1984). Models for estimation of technical and scale inefficiencies in data envelopment analysis. Management Science, 30, 1078–1092.
4. Bartels, R., & Golub, G. (1969). The simplex method of linear programming using LU decomposition. Communications of the ACM, 12, 266–268.
5. Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2010). Linear programming and network flows (4th ed.). New Jersey: Wiley.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献