1. Aronson, J., Barr, R., Helgason, R., Kennington, J., Loh, A., & Zaki, H. (1985). The projective transformation algorithm of Karmarkar: a computational experiment with assignment problem (Technical Report 85-OR-3). Department of operations research, Southern Methodist University, Dallas, TX.
2. Barnes, E., Chen, V., Gopalakrishnan, B., & Johnson, E. L. (2002). A least squares primal-dual algorithm for solving linear programming problems. Operations Research Letters, 30, 289–294.
3. Beasly, J. E. OR-Library. Management School, Imperial College, London, http://mscmga.ms.ic.ac.uk/info.html .
4. Bertsekas, D. P., & Tseng, P. (1988a). The relax codes for linear minimum cost network flow problems. Annals of Operation Research, 1(4), 125–190.
5. Bertsekas, D. P., & Tseng, P. (1988b). Relaxation methods for minimum cost ordinary and generalized network flow problems. Operations Research, 36(4), 93–114.