Disjunctive programming: Properties of the convex hull of feasible points

Balas, 1972, Integer programming and convex analysis, Math. Programming, 2, 330, 10.1007/BF01584553 Balas, 1972, Nonconvex quadratic programming via generalized polars. MSRR No. 278 Forthcoming in the SIAM J. Appl. Math. Balas, 1973, On the use of intersection cuts in branch and bound E. Balas, Intersection cuts from disjunctive constraints, MSRR No. 330, Carnegie-Mellon University. First draft August 1973, revised and expanded February 1974. Balas, 1974, Cutting planes from logical conditions Gale, 1960 Glover, 1973, Polyhedral annexation in mixed integer programming, MSRR No. 73-9 Glover, 1973, The generalized lattice point problem, Oper. Res., 21, 141, 10.1287/opre.21.1.141 Glover, 1973, Improved Convexity Cuts for Lattice Point Problems, 10.1007/BF00934097 Grünbaum, 1967 R.G. Jeroslow, Personal communication, March 1974. Jeroslow, 1974 Owen, 1973, Cutting planes for programs with disjunctive constraints, J. Optim. Theory Appl., 11, 49, 10.1007/BF00934290 Rockafellar, 1970 Stoer, 1970 Zwart, 1972