On the number of vertices in integer linear programming problems

2006/11/12 by Nikolai Yu. Zolotykh, Zolotykh, Nikolai Yu.
Engineering · Mathematics · #05A16 #90C10 #90C57 #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Packing Problems #Vehicle Routing Optimization Methods #math.CO #msc:05A16 #msc:90C10 #msc:90C57

paper · pdf · doi:10.48550/arxiv.math/0611356

12 pages

arxiv created 2006/11/12 · openalex publication_date 2006/11/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• New Bounds for the Vertices of the Integer Hull
• Enumerating integer points in polytopes with bounded subdeterminants
• How to Find the Convex Hull of All Integer Points in a Polyhedron?
• Computing convex hulls and counting integer points with polymake
• Minkowski's Convex Body Theorem and Integer Programming