Computing the integer hull of convex polyhedral sets (Q2109987)

A convex polyhedron is a subset \(P\subset \mathbb{Q}^d\) such that \(P=\{\mathbf{x}\in\mathbb{Q}^d \ | \ A\mathbf{x}\le b \}\) where \(A\in \mathbb{Q}^{m\times d}\), \(b\in \mathbb{Q}^m\) and \(m\) and \(d\) are positive integers. The smallness convex polyhedron containing the integer points of \(P\) is called the integer hull of \(P\) and is denoted by \(P_I\). The aim of this paper is to describe a new algorithm for computing \(P_I\). The authors also provide two implementations of this algorithm in Maple and in the C programming language. The efficiency of the proposed algorithm compared to the related function in Normaliz has been discussed via a set of examples. For the entire collection see [Zbl 07573785].