We propose a cutting plane algorithm for mixed 0-1 programs based on a family of polyhedra which strengthen the usual LP relaxation. We show how to generate a facet of a polyhedron in this familyâ€¦ (More)

In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes pure and mixed integer programs and many other nonconvex programmingâ€¦ (More)

A necessary and sufficient condition is given for an inequality with coefficients 0 or 1 to define a facet of the knapsack polytope, i.e., of the convex hull of 0 1 points satisfying a given linearâ€¦ (More)

In April 1967 I and my family arrived into the US as fresh immigrants from behind the Iron Curtain. After a fruitful semester spent with George Dantzigâ€™s group in Stanford, I started working at CMU.â€¦ (More)

The polyhedron defined by all the split cuts obtainable directly (i.e. without iterated cut generation) from the LP-relaxation P of a mixed integer program (MIP) is termed the (elementary, or rank 1)â€¦ (More)