M. Hifi, M. Michrafy, A Reactive Local Search-Based Algorithm for the Disjunctively Constrained Knapsack Problem, The Journal of the Operational Research Society, Vol. 57, No. 6 (Jun., 2006), pp.

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

Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.