Iterative relaxation based algorithms for the bi-objective max-min knapsack problem - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year :
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-03537781 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More