Branch-and-bound algorithms are adequate for the solution of a wide range of 0-1 knapsack problems. It is shown that the simplest method of branching is as good as any. However, problems with highly ...

For the 0-1 knapsack problem with equality constraint a partitioning procedure is introduced which focuses on the core of the problem. The purpose of the procedure is to reduce the required ...