An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2017

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

(1) , (2) , (3)
1
2
3
Not file

Dates and versions

hal-01666303 , version 1 (18-12-2017)

Identifiers

Cite

Fabio Furini, Ivana Ljubić, Markus Sinnl. An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. European Journal of Operational Research, 2017, 262 (2), pp.438 - 448. ⟨10.1016/j.ejor.2017.03.061⟩. ⟨hal-01666303⟩
130 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More