Write the knapsack cuts that correspond to the non-maximal packings I = {1}, {2}, {3}, {4} for constraint (2.3a).
If a linear programming solver is available, verify that when these cuts are added to the relaxation (2.6), the resulting branch-and-relax tree has five rather than seven nodes.