1. G.B. Dantzig, “Minimization of a linear function of variables subject to linear inequalities”, in:Activity analysis of production and allocation, Ed. T.C. Koopmans (Wiley, New York, 1951) 339–347.
2. J.C. Dickson and F.P. Frederick, “A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm”,Communications of the Association for Computing Machinery 3 (1960) 509–512.
3. P.M.J. Harris, “An algorithm for solving mixed integer linear programmes”,Operational Research Quarterly 15 (2) (1964) 117–132.
4. H.W. Kuhn and R.E. Quandt, “An experimental study of the simplex method”, in:Proceedings of Symposia in Applied Mathematics 15 (American Mathematical Society, Providence, R.I., 1963) 107–124.
5. P. Wolfe and L. Cutler, “Experiments in linear programming”, in:Recent advances in mathematical programming, Eds. R. Graves and P. Wolfe (McGraw-Hill, New York, 1963).