We use a technique by Frank and Tardos (Combinatorica 1987) to settle an open problem in kernelization.
We present a polynomial kernelization for Knapsack parameterized by number of items.
The method can be generally used to obtain polynomial kernels for weighted problems.
We give kernels for e.g. Subset Sum, Weighted d-Hitting Set, and ILP with bounded variables.