Search
Now showing items 1-1 of 1
Grey wolf optimization for 0/1 multiple knapsack problem
(International University - HCMC, 2019)
The 0/1 Multiple Knapsack Problem (01MKP) is the extension of the classical 0/1 Knapsack Problem (01KP), which is the well-known NP-hard problem in combinatorial optimization. In lieu of considering a single knapsack with ...