An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem
Published in Eur. J. Oper. Res. 262(2): 438-448, 2017
Bibtex:
@article{DBLP:journals/eor/FuriniLS17,
author = {Fabio Furini and
Ivana Ljubic and
Markus Sinnl},
title = {An effective dynamic programming algorithm for the minimum-cost maximal
knapsack packing problem},
journal = {Eur. J. Oper. Res.},
volume = {262},
number = {2},
pages = {438--448},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.03.061},
doi = {10.1016/j.ejor.2017.03.061},
timestamp = {Fri, 21 Feb 2020 13:16:48 +0100},
biburl = {https://dblp.org/rec/journals/eor/FuriniLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}