1 paper
Congcong Wu, Xiangyun Gao, Xueyong Liu +1
The set-union knapsack problem (SUKP) is a constrained composed optimization problem. It is more difficulty for solving because values and weights depend on items and elements resp…