This paper presents a method for the solution of nonlinear integer optimization problems with a linear objective function and a bounded feasible region. The algorithm applies the principle of bundling to a linear auxiliary problem using so-called foundational knapsack bundles. A concluding example shall illustrate the algorithm, and some numerical results are given.