1. E. Balas, “Intersection Cuts — A new type of cutting planes for integer programming”,Operations Research 19 (1971) 19–39.
2. G. Gallo, “On Hoang Tui's concave programming algorithm”, Nota Scientifica S-76-1, Instituto di Scienze dell'Informazione, University of Pisa Italy (1975).
3. F. Glover, “Convexity cuts and cut search”,Operations Research 21 (1973) 123–134.
4. B. Grünbaum,Convex polytopes (Wiley, New York, 1967).
5. H. Konno, “Bilinear programming: Part I. Algorithm for solving bilinear programs”, Tech. Rept. No. 71-9, Stanford University, Stanford, CA (1971).