A Fixed-Parameter Algorithm for 4-Block Integer Programming

Abstract

We give a fixed parameter tractable (FPT) algorithm with running time $f(k,\Delta)\cdot {|I|}^{O(1)}$ for integer linear programs with 4-block structure, parameterized by the maximum block dimension $k$ and the largest absolute matrix entry $\Delta$. This result resolves a long-standing open question in parameterized complexity, and answers a conjecture by Eisenbrand and Rothvoss (2026) in the positive. This result has several implications for other block-structured integer programming models, including 3-block, mixed fracture number, and special cases of 4-block programs with large entries outside of the diagonal. Important tools for this algorithm are structural properties of generalized $n$-fold integer programs shown by Ligthart~(2026) and an algorithm by Veselov et al.~(2020) for optimizing discrete convic functions.