The LP Procedure


  • Bartels, R. (1971), “A Stabilization of the Simplex Method,” Numerical Mathematics, 16, 414–434.

  • Bland, R. G. (1977), “New Finite Pivoting Rules for the Simplex Method,” Mathematics of Operations Research, 2, 103–107.

  • Breau, R. and Burdet, C. A. (1974), “Branch and Bound Experiments in Zero-One Programming,” Mathematical Programming Study, 2, 1–50.

  • Crowder, H., Johnson, E. L., and Padberg, M. W. (1983), “Solving Large-Scale Zero-One Linear Programming Problems,” Operations Research, 31, 803–834.

  • Dantzig, G. B. (1963), Linear Programming and Extensions, Princeton, NJ: Princeton University Press.

  • Garfinkel, R. S. and Nemhauser, G. L. (1972), Integer Programming, New York: John Wiley & Sons.

  • Greenberg, H. J. (1978), “Pivot Selection Tactics,” in H. J. Greenberg, ed., Design and Implementation of Optimization Software, 143–174, Leyden, Netherlands: Sijthoff & Noordhoff.

  • Hadley, G. (1962), Linear Programming, Reading, MA: Addison-Wesley.

  • Harris, P. (1975), “Pivot Selection Methods of the Devex LP Code,” Mathematical Programming Study, 4, 30–57.

  • Ignizio, J. P. (1976), Goal Programming and Extensions, Lexington, MA: D.C. Heath and Company.

  • Murtagh, B. A. (1981), Advanced Linear Programming: Computation and Practice, New York: McGraw-Hill.

  • Nelson, M. (1992), The Data Compression Book, M&T Books.

  • Reid, J. K. (1975), “A Sparsity-Exploiting Variant of the Bartels-Golub Decomposition for Linear Programming Bases,” Harwell Report CSS 20.

  • Reid, J. K. (1976), “Fortran Subroutines for Handling Sparse Linear Programming Bases,” Harwell Report R 8269.

  • Savelsbergh, M. W. P. (1994), “Preprocessing and Probing Techniques for Mixed Integer Programming Problems,” ORSA J. on Computing, 6, 445–454.

  • Taha, H. A. (1975), Integer Programming, New York: Academic Press.