1. M. Altman, “Bilinear programming”,Bulletin d'Academie Polonaise des Sciences 16(9) (1968) 741–746.
2. E. Balas, “Intersection cuts—A new type of cutting planes for integer programming”,Operations Research 19 (1971) 19–39.
3. E. Balas, “Intersection cuts from disjunctive constraints”, Management Science Research Report No. 330, Carnegie-Mellon University (Pittsburg, PA, February 1974).
4. E. Balas and C.A. Burdet, “Maximizing a convex quadratic function subject to linear constraints”, Management Science Research Report No. 299, Carnegie-Mellon University (Pittsburg, PA, July 1973).
5. C.A. Burdet, “Polaroids: A new tool in nonconvex and in integer programming”,Naval Research Logistics Quarterly 20 (1973) 13–22.