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 ...

Experience from these tests indicate that the presented approach outperforms any known algorithm for KP, having very stable solution times. OR professionals in every field of study will find ...