Igor Crévits

Learn More
In this paper we propose new hybrid methods for solving the multidimensional knapsack problem. They can be viewed as matheuris-tics that combine mathematical programming with the variable neighbourhood decomposition search heuristic. In each iteration a relaxation of the problem is solved to guide the generation of the neighbourhoods. Then the problem is(More)