Updated triangular factors of the basis to maintain sparsity in the product form simplex method. - John J. H. Forrest; John A. Tomlin (Math. Program., 1972)

Global optimization using special ordered sets. - E. M. L. Beale; John J. H. Forrest (Math. Program., 1976)

Implementing the Simplex Method for the Optimization Subroutine Library. - John J. H. Forrest; John A. Tomlin (IBM Syst. J., 1992)

Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library. - John J. H. Forrest; John A. Tomlin (IBM Syst. J., 1992)

Steepest-edge simplex algorithms for linear programming. - John J. Forrest; Donald Goldfarb (Math. Program., 1992)

A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints. - John J. H. Forrest; Jayant Kalagnanam; Laszlo Ladányi (INFORMS J. Comput., 2006)

Branch and bound, integer, and non-integer programming. - John J. H. Forrest; John A. Tomlin (Ann. Oper. Res., 2007)