1. E. Balas, Disjunctive programming: Cutting-planes from logical conditions, in:Nonlinear Programming 2, ed. O.L. Mangasarian, R.R. Meyer and S.M. Robinson (Academic Press, New York, 1975) pp. 279–312.
2. E. Balas, Disjunctive programming: Facets of the convex hull of feasible points, No. 348, GSIA, Carnegie-Mellon University (1974).
3. E. Balas, Disjunctive programming, in:Discrete Optimization II, ed. P.L. Hammer, E.L. Johnson and B.H. Korte (North-Holland, Amsterdam, 1979) pp. 3–52.
4. E. Balas, Disjunctive programming and a hierarchy of relaxations for discrete optimization problems, Technical Report, Carnegie-Mellon University (1983).
5. E.M.L Beale, Branch and bound methods for mathematical programming, in:Discrete Optimization II, ed. P.L. Hammer, E.L. Johnson and B.H. Korte (North-Holland, Amsterdam, 1979) pp. 201–221.