Abstract: The Set-Union Knapsack Problem (SUKP) is a complex combinatorial optimization problem that extends the classic Knapsack with each item composed of several distinct weighted elements instead ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results