1. E. Balas, “Disjunctive programming: Cutting planes from logical conditions,” in: O. L. Mangasarian et al., eds.,Nonlinear Programming, Vol. 2 (Academic Press, New York, 1975) pp. 279–312.
2. C.E. Blair, “Two rules for deriving valid inequalities for 0–1 problems,”SIAM Journal of Applied Mathematics 31 (1976) 614–617.
3. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete Mathematics 4 (1973) 305–337.
4. W. Cook, R. Kannan and A. Schrijver, “Chvátal closures for mixed integer programming problems,” Report No. 86444-OR, Institute for Econometrics and Operations Research, Bonn University (Bonn, 1987).
5. R. E. Gomory, “An algorithm for integer solutions to linear programs,” in: R. Graves and P. Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963) pp 269–302.