1. Atkinson, D.S., and Vaidya, P.M.: 1992, ‘A Cutting Plane Algorithm that Uses Analytic Centers’, Working Paper, Department of Mathematics, University of Illinois at Urbana-Champaign.
2. Bahn, O., Goffin, J.L., Vial, J.-Ph., and Du Merle, O.: 1991, ‘Implementation and Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: an Application to Geometric Programming’, Working Paper, Université de Genève, Genève, Switzerland. To Appear in Annals of Discrete Mathematics.
3. Dantzig, G.B., and Ye, Y.: 1990, ‘A Build-Up Interior Method for Linear Programming: Affine Scaling Form’, Technical Report SOL 90 -4, Systems Optimzation Laboratory, Department of Operations Research, Stanford University, Stanford, California.
4. Den Hertog, D., Roos, C., and Terlaky, T.: 1992, ‘A Build-Up Variant of the Path-Following Method for LP’, Operations Research Letters Vol. no. 12, pp. 181–186.
5. Den Hertog, D., Roos, C., and Vial, J.-Ph.: 1992, ‘A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming’, SIAM Journal on Optimization Vol. no. 2, pp. 71–87.