The knapsack problem is an optimization problem where a thief needs to make choices among various items, each with a specific weight and value, while respecting the capacity of a given knapsack. Each ...

The multiple-choice knapsack problem (MCKP) is a classic NP-hard combinatorial optimization problem. Motivated by several significant real-world applications, this work investigates a novel variant of ...

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 ...