The set-union knapsack problem (SUKP) is a generalization of knapsack problem where an item corresponds to a set of elements. SUKP has various applications including information security systems. We propose a variable neighborhood search for the SUKP and the computational results on a set of benchmark instances show its efficiency.