1. Intersection cuts – A new type of cutting-plane for integer programming;Balas;Operations Res.,1971
2. Integer programming and convex analysis: Intersection cuts from outer polars;Balas;Math. Programming,1972
3. E. Balas, On the use of intersection cuts and outer polars in branch-and-bound, talk given at the MPS conference in Stanford, August 1973
4. E. Balas, Intersection cuts from disjunctive constraints, Man. Sci. Res. Rep. No. 330, Carnegie-Mellon University, February 1974
5. Disjunctive programming: Facets of the convex hull of feasible points, Man. Sci. Res. Rep. No. 348;Balas,1974