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

Fabio Furini; Ivana Ljubić; Markus Sinnl

doi:10.1016/j.ejor.2017.03.061

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

Fabio Furini

Function : Author

Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

Ivana Ljubić

Function : Author

Essec Business School

Markus Sinnl

Function : Author
PersonId : 1025144

Integrated Optimization with Complex Structure

Domains

Computer Science [cs] Operations Research [cs.RO]

Markus Sinnl : Connect in order to contact the contributor

https://hal.inria.fr/hal-01666303

Submitted on : Monday, December 18, 2017-11:11:29 AM

Last modification on : Friday, March 24, 2023-2:53:05 PM

Dates and versions

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

Identifiers

HAL Id : hal-01666303 , version 1
DOI : 10.1016/j.ejor.2017.03.061

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

ESSEC CNRS INRIA UNIV-DAUPHINE LAMSADE-DAUPHINE CRISTAL INRIA2 PSL UNIV-LILLE

141 View

0 Download

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share