1. B. Grunbaum,Convex polytopes (John Wiley, New York, 1967).
2. V. Klee, “Polytope pairs and their relationship to linear programming”,Acta Mathematica CXXXIII (1974) 1–25.
3. T.M. Liebling, “On the number of iterations of the simplex method”, in: X. Henn, X. Kunzi and X. Schubert, eds.,Methods of Operations Research, XVII, Sounderdruck (August 1972) pp. 264–284.
4. T.H. Mattheiss, “An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities”,Operations Research XXI (1973) 247–260.
5. T.H. Mattheiss and D.S. Rubin, “A survey and comparison of methods for finding all vertices of convex polyhedral sets”, Technical Report No. 77-14, Department of Operations Research and Systems and Systems Analysis, University of North Carolina at Chapel Hill (Chapel Hill, NC, November 1977).