1. I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, “Data structures and programming techniques for the implementation of Karmarkar's algorithm,”ORSA Journal on Computing 1(2) (1989).
2. I. Adler and R.C. Monteiro, “Limiting behaviour of the affine-scaling continuous trajectories for linear programming problems,” Report ESRC 88-9, Engineering Systems Research Center, University of California (Berkeley, CA, 1988).
3. A.I. Ali and J.L. Kennington, “Mnetgn program documentation,” Technical Report IEOR 77003, Department of Industrial Engineering and Operations Research, Southern Methodist University (Dallas, TX, 1977).
4. J. Aronson, R. Barr, R. Helgason, J. Kennington, A. Loh and H. Zaki, “The projective transformation algorithm by Karmarkar: A computational experiment with assignment problems,” Technical Report 85-OR-3, Department of Operations Research, Southern Methodist University (Dallas, TX, August 1985).
5. E.R. Barnes, “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.