Variable neighborhood search for the set union knapsack problem - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year :

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.
Not file

Dates and versions

hal-03472589 , version 1 (09-12-2021)

Identifiers

  • HAL Id : hal-03472589 , version 1

Cite

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⟩
17 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More