Zequn Wei and Jin-Kao Hao, Multistart solution-based tabu search for the Set-Union Knapsack Problem. Applied Soft Computing, 2021.
The two sets of 60 SUKP benchmark instances tested in the paper are
The certificates of our best solutions for the 60 SUKP benchmark
instances are available here.
The code of our MSBTS algorithm will be