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.

中文翻译：

---

如何找到多面体中所有整数点的凸包？

我们提出了一种基于切割的算法，用于查找由线性不等式系统定义的多面体的所有整数点的凸包的所有顶点和所有面。我们的算法 DDM Cuts 基于 Gomory 切割和双重描述方法的动态版本。我们描述了该算法的计算机实现，并展示了将我们的算法与简单算法进行比较的计算实验结果。