The mt2 algorithm by Martello and Toth for the solution of large sized 0–1 Knapsack Problems shows anomalous behavior: some instances are solved in fractions of a second, while similar instances cannot be solved in hours. In this paper it is shown that the anomalous behavior is due to an a-priori identification of the so-called core. By evading the solution of the core problem, we are able to avoid the anomalous behavior.
