1. Adler, I., “The expected number of pivots needed to solve parametric linear programs and the efficiency of the self-dual simplex method,” Draft, Department of Industrial Engineering and Operations Research, University of California (Berkeley, CA, 1983).
2. Adler, I. and N. Megiddo, “A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension,” Journal of the ACM 32 (1985), 871-895.
3. Aneja, Y. P., V. Aggarwal and K. P. K. Nair, “On a class of quadratic programs,” European Journal of Operational Research 18 (1984), 62-70.
4. Bector, C. R., and M. Dahl, “Simplex type finite iteration technique and reality for a special type of pseudo-concave quadratic functions,” Cahiers du Centre d’Études de Recherche Opérationnelle 16 (1974), 207-222.
5. Borgwardt, K. H., “Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex method,” Mathematics of Operations Research 7 (1982), 441-462.