Abstract: 0pt0pt Multiple Knapsack Problem (MKP) is a difficult combinatorial optimization problem. It is one of the most studied optimization problem, because a lot of economical, practical and ...
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