Enumerating integer points in polytopes with bounded subdeterminants

19 Feb 2021 · Hongyi Jiang, Amitabh Basu ·

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This extends a previous result by Artmann et al. who showed that integer linear optimization in such polytopes can be done in polynomial time.