Bansal, Sulabh; Patvardhan, C. - In: International Journal of Applied Evolutionary … 9 (2018) 1, pp. 17-51
This article describes how the 0/1 Multiple Knapsack Problem (MKP), a generalization of popular 0/1 Knapsack Problem, is NP-hard and harder than simple Knapsack Problem. Solution of MKP involves two levels of choice – one for selecting an item to be placed and the other for selecting the...