On the number of vertices in integer linear programming problems
classification
🧮 math.CO
keywords
integerlinearnumberverticesconvexdefinedgivehull
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.