1. Adler, I., and Berenguer, S. (1981). Random linear programs (Techincal Report 81-4). Operations Research Center Report, U.C. Berkeley.
2. Adler, I., and Megiddo, N. (1985). A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Journal of the ACM, 32, 871–895.
3. Adler, I., Karmarkar, N., Resende, M., and Veiga, G. (1989). An implementation of Karmarkar’s algorithm for linear programming. Mathematical Programming, 44, 297–335.
4. Ahuja, R., Magnanti, T., and Orlin, J. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
5. Anstreicher, K. (1996).
http://www-unix.mcs.anl.gov/otc/InteriorPoint/abstracts/Anstreicher-1.html
Potential reduction algorithms (Technical Report). Department of Management Sciences, University of Iowa.