Abstract: The multidimensional knapsack problem (MKP) is a well-known NP-hard combinatorial optimization problem which can be employed to model many practical engineering problems. Metaheuristic ...

Abstract: Because it is classified as NP-hard, the binary knapsack problem is a good example of a combinatorial optimization problem that still presents increased difficulty when attempting to ...