Development of core to solve the multidimensional multiple-choice knapsack problem

The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0–1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate core for the MMKP and utilize it to solve the problem exactly. Computational results show that the algorithm can solve large uncorrelated instances (up to 100 classes and 100 items in each class) and correlated instances with small number of constraints (up to 5) efficiently. In particular, it solves recently published hard instances for the MMKP in less than a second. The algorithm consumes negligible memory, and compared with the best previous exact algorithm for the MMKP performs significantly faster.