We perform a computational study on 0-1 knapsack problems generated under explicit correlation induction. A total of 2000 100-variable test problems are solved. We use two solution methods: (1) a well known heuristic and (2) a representative branch and bound type algorithm. Two different performance measures are considered: (1) the number of nodes needed to find an optimal solution and (2) the relative error of the heuristic solution. We also examine the effect of different joint probability mass functions (pmfs) for the coefficient values on the performance of the solution procedure.