Skip to Main content Skip to Navigation
Conference papers

Variable neighborhood search for the set union knapsack problem

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03472589
Contributor : Marie ZOIA Connect in order to contact the contributor
Submitted on : Thursday, December 9, 2021 - 2:02:42 PM
Last modification on : Wednesday, March 16, 2022 - 3:46:13 AM

Identifiers

  • HAL Id : hal-03472589, version 1

Collections

Citation

Bernard Gendron, Said Hanafi, Raca Todosijević. Variable neighborhood search for the set union knapsack problem. Journées de l’Optimisation / Optimization Days, 2019, Montréal, Canada. ⟨hal-03472589⟩

Share

Metrics

Record views

15