1. Intersection Cuts—A New Type of Cutting Planes for Integer Programming
2. “Solution of a Fixed Charge Linear Programming Problem,” Proceedings of Princeton Symposium on Mathematical Programming (Princeton University Press, Princeton, New Jersey, 1970), pp. 367–375.
3. Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
4. Convexity Cuts and Cut Search