On the number of vertices in integer linear programming problems

Abstract

We give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.

12 pages

Cited by in corpus (2)

• On the number of irreducible points in polyhedra
• Note on the Complexity of the Mixed-Integer Hull of a Polyhedron