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 J. on Comput., 1 (2): 84–106, 1989.
2. E. D. Andersen. Finding all linearly dependent rows in large-scale linear programming.Optimization Methods and Software, 6: 219–227, 1995.
3. E. D. Andersen and K. D. Andersen. Presolving in Linear Programming. Preprint 35, Dept. of Math, and Computer Sci., Odense University, 1993. To appear in Math. Programming.
4. E. D. Andersen and Y. Ye. Combining interior-point and pivoting algorithms for linear programming. Technical report, Department of Management Sciences, The University of Iowa, 1994. Available via anonymous ftp from ftp://col.biz.uiowa.edu/pub/papers/cross.ps.Z, to appear in Management Science.
5. K. D. Andersen. A modified Schur complement method for handling dense columns in interior point methods for linear programming. Technical report, Dept. of Math, and Computer Sci., Odense University, 1994. Submitted to ACM Transaction on Mathematical Software.