1. Intersection Cuts—A New Type of Cutting Planes for Integer Programming
2. Location-Allocation Problems
3. and , “Bilinear Programming: An Exact Algorithm”, Operations Research Center Report No. ORC 73–26, University of California, Berkeley, California (1973).
4. Convex Polytopes (John Wiley, 1967).
5. “Bilinear Programming”, Parts I and II.Technical Report No. 71-9 and 71–10, Operations Research House, Stanford University (1971).