1. Technical Report ORC 81-4;I. Adler,1981
2. C. Allendoerfer and A. Weil, “The Gauss-Bonnet theorem for Riemannian polyhedra”, Transactions of the American Mathematical Society 53 (1943) 101–129.
3. K.-H. Borgwardt, “The average number of steps required by the simplex method is polynomial”, to appear in Zeitschrift für Operations Research.
4. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming”, in: G.B. Dantzig and A.F. Veinott, Jr., eds., Mathematics of the Decision Sciences, Part 1 (American Mathematical Society, Providence, RI, 1968) pp. 115–136.
5. G.B. Dantzig, Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).