Iterative relaxation based algorithms for the bi-objective max-min knapsack problem - Université Polytechnique des Hauts-de-France Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Iterative relaxation based algorithms for the bi-objective max-min knapsack problem

Fichier non déposé

Dates et versions

hal-03537781 , version 1 (20-01-2022)

Identifiants

  • HAL Id : hal-03537781 , version 1

Citer

Said Hanafi, Raid Mansi, Christophe Wilbaut, Arnaud Fréville. Iterative relaxation based algorithms for the bi-objective max-min knapsack problem. 26th European Conference on Operational Research, Jul 2013, Rome, Italy. ⟨hal-03537781⟩
5 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More