How to Find the Convex Hull of All Integer Points in a Polyhedron?

S. O. Semenov, N. Yu. Zolotykh

We propose a cut-based algorithm for finding all vertices and all facets of the convex hull of all integer points of a polyhedron defined by a system of linear inequalities. Our al…