1. Intersection Cuts—A New Type of Cutting Planes for Integer Programming
2. Integer programming and convex analysis: Intersection cuts from outer polars
3. “Nonconvex Quadratic Programming Via Generalized Polars,” Management Science Research Report No. 278, GSIA, Carnegie-Mellon University (1972).
4. “Disjunctive Programming: Properties of the Convex Hull of Feasible Points,” Management Science Research Report 348, GSIA, Carnegie-Mellon University (1974)
5. and , “Maximizing a Convex Quadratic Function Subject to Linear Constraints,” Management Science Research Report No. 299, GSIA, Carnegie-Mellon University (1973).