Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075)

The authors present an algorithm for finding an integer point, or verify that none exists, in an \(n\) dimensional simplex which is given by an \((n+1) \times n\) matrix of integer coefficients. The algorithm is a homotopy-like simplicial algorithm that can use arbitrary starting points and gives an answer to the problem in a finite number of iterations. An illustrative example and some computational experiences are also given.