Abstract: The Multi-Dimensional Knapsack Problem (MDKP) is a strongly NP-Hard combinatorial optimization problem that extends the Knapsack Problem (KP) to multiple constraints. While effective ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results