Variable neighborhood search for the set union knapsack problem - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Variable neighborhood search for the set union knapsack problem

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-03472589 , version 1

Citer

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⟩
19 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More