“It represents the first [major] improvement to ILP solvers in nearly 40 years.”
Integer linear programming runs airline schedules, shipping routes and power grids. Victor Reis and Thomas Rothvoss cut the worst-case bound for general integers to (log n)^O(n), close to the 0-or-1 case. The old record came from the 1980s. Commercial solvers ignore worst cases anyway, so nobody’s freight bill drops tomorrow.