1. “The Revised Duplex Algorithm for Linear Programming,” M. S. Thesis, Washington University, (1966).
2. and , “Computational Suggestions for Maximizing a Linear Function Subject to Linear Inequalities,” pp. 377–380, Activity Analysis of Production and Allocation, Edited by (John Wiley and Sons, New York, 1951).
3. An Out-of-Kilter Method for Minimal-Cost Flow Problems
4. The Hungarian method for the assignment problem
5. The Simplex Method: Two Basic Variables Replacement