Alberto Del Pia

On convergence in mixed integer programming

Let

On the Diameter of Lattice Polytopes

{P \subseteq {\mathbb R}^{m+n}}

Integer quadratic programming in the plane

be a rational polyhedron, and let PI be the convex hull of

A Polyhedral Study of Binary Polynomial Programs

{P \cap ({\mathbb Z}^m \times {\mathbb R}^n)}

On the Mixed Binary Representability of Ellipsoidal Regions

. We define the integral lattice-free closure of P as the set obtained from P by adding all inequalities obtained from disjunctions associated with integral lattice-free polyhedra in