CUDA-based parallel local search for the set-union knapsack problem
(2024)
Journal Article
The Set-Union Knapsack Problem (SUKP) is a complex combinatorial optimisation problem with applications in resource allocation, portfolio selection, and logistics. This paper presents a parallel local search algorithm for solving SU... Read More about CUDA-based parallel local search for the set-union knapsack problem.