The abstract is more informative: https://arxiv.org/abs/2303.14605 https://arxiv.org/abs/2303.14605 We obtain a (log(2n))^O(n)-time randomized algorithm to

The abstract is more informative: https://arxiv.org/abs/2303.14605 https://arxiv.org/abs/2303.14605 We obtain a (log(2n))^O(n)-time randomized algorithm to solve integer programs in n variables. So the work is theoretical: a better exponential-time algorithm than the previous best, based on some analysis of the structure of convex bodies in R^n and how they can be covered by integer grids (lattices). Most of the practical work on ILPs uses heuristics and branch and bound while taking advantage of the special structure of particular problem formulations. It isn't clear if this work could be used to help either of those, and I imagine without someone from Gurobi (or similar) chiming in, I wouldn't be able to tell from reading the paper.