A Lagrangian and surrogate information enhanced tabu search for the MMKP

The multidimensional multi-choice knapsack problem (MMKP) is NP-hard. Within the framework of solving this problem, we suggest newer approaches. We not only propose a multi-starts version of our previous works approach using surrogate constraint informations based choices [31][32], but also we introduce another newer heuristic. The latter uses Lagrangian relaxation informations in place of surrogate informations. Compared with other literature known methods described so far, our approaches experimentations results are competitive.