S. O. Semenov, N. Yu. Zolotykh
Published 2020-10-25Version 1
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 algorithm DDM Cuts is based on the Gomory cuts and the dynamic version of the double description method. We describe the computer implementation of the algorithm and present the results of computational experiments comparing our algorithm with a naive one.
On the convex hull of integer points above the hyperbola
The Convex Hull of Parking Functions of Length $n$
Integer Points in Knapsack Polytopes and s-covering Radius
![QR code for arXiv:2010.13147 [math.CO]](http://oss.arxitics.com/images/favicon.svg)