1. E. Balas and R. Jeroslow, “Cannonical cuts on the unit hypercube”,Management Sciences Research Report Series, No. 198(R), Carnegie-Mellon University, Pittsburgh, Pa. August–December 1969, revised February 1971).
2. V. Chvátal, “Edmonds polyhedra and a hierarchy of combinatorial problems”,Discrete Mathematics 4 (1973) 305–337.
3. F. Glover, “Unit-coefficient inequalities for zero–one programming”, Management ScienceReport Series, No. 73-7University of Colorado, Boulder, Colo. (July 1973).
4. F. Glover, “Polyhedra Annexations in mixed integer programming”,Management Science Report Series, No. 73-9University of Colorado, Boulder, Colo. (August 1973).
5. R.E. Gomory, “Some polyhedra related to combinatorial problems”,Linear Algebra and its Applications 2 (1969) 451–558.