Abstract: This paper proposes a multitask knapsack problem framework as a discrete test suite that allows for the independent adjustment of both objective and constraint similarities among tasks. The ...
Abstract: The Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem. Because exact methods fail on the large-scale instances encountered in industrial ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results