Integer programs with a fixed number of constraints are solvable in pseudo-polynomial time the largest coefficient any constraint. We give new algorithm which improves running state art. Moreover, we show that improving on our for is equivalent to over quadratic (min, +)-convolution. This strong evidence algorithm’s best possible. also present specialized testing feasibility an integer program ...