1. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, “An implementation of Karmarkar algorithm for linear programming,”Mathematical Programming 44 (1989) 297–335.
2. I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, “Data structures and programming techniques for the implementation of Karmarkar's algorithm,”ORSA Journal of Computing 1(2) (1989).
3. E.R. Barnes, S. Chopra and D.L. Jensen, “A polynomial time version of the affine scaling algorithm,” Technical Report No. 88-101, Graduate School of Business Administration, New York University (Washington Square, NY, 1988).
4. D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming I, affine and projective scaling trajectories,”Transactions of the American Mathematical Society 314 (1989) 499–526.
5. C. Berge,Graphs and Hypergraphs (North-Holland, New York, 1973).