Adler, I., Karp, R. and Shamir, R. (1986) A Family of Simplex Variants Solving an Linear Program in Expected Number of Pivot Steps Depending on d Only. Mathematics of Operations Research, 11, 570-590.
https://doi.org/10.1287/moor.11.4.570

has been cited by the following article:

• TITLE: Posterior Constraint Selection for Nonnegative Linear Programming

  AUTHORS: H. W. Corley, Alireza Noroziroshan, Jay M. Rosenberger

  KEYWORDS: Linear Programming, Nonnegative Linear Programming, Large-Scale Problems, Active Set Methods, Constraint Selection, Posterior Method, COSTs

  JOURNAL NAME: American Journal of Operations Research, Vol.7 No.1, January 11, 2017

  ABSTRACT: Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic and non-dynamic active-set framework. The computational performance of these methods is compared with the CPLEX standard linear programming algorithms, with two most-violated constraint approaches, and with previously developed COST algorithms for large-scale problems.