Zhou, Yupeng; Zhao, Mengyu; Fan, Mingjie; Wang, Yiyuan; … - In: Data Technologies and Applications 55 (2021) 2, pp. 233-250
Purpose The set-union knapsack problem is one of the most significant generalizations of the Non-deterministic Polynomial (NP)-hard 0-1 knapsack problem in combinatorial optimization, which has rich application scenarios. Although some researchers performed effective algorithms on normal-sized...
