The Journal of the Operational Research Society, Vol. 47, No. 3 (Mar., 1996), pp. 457-462 (6 pages) In this paper we present a new branch and bound algorithm for solving a class of integer quadratic ...

We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...

The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...