1. E. Balas, “The intersection cut — A new cutting plane for integer programming”,Management Science Research Report No. 187 (1969), Carnegie-Mellon University.
2. E. Balas, “Intersection cuts from maximal extensions of the ball and the octahedron”, 7th Mathematical Programming Symposium, The Hague (1970),Mathematical Programming to be published.
3. C.-A. Burdet, “A class of cuts and related algorithms in integer programming”,Management Science Research Report No. 220 (1970) Carnegie-Mellon University.
4. C.-A. Burdet, “The method of enumerative cuts”, IBM, RC 3174 (1970) Watson Research Center, New York.
5. A. Geoffrion, “Integer programming by implicit enumeration and Balas' method”,SIAM Review 9 (1967) 178–190.