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: 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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results