An iterative algorithm for the Max-Min knapsack problem with multiple scenarios
Crossref DOI link: https://doi.org/10.1007/s12351-019-00463-7
Published Online: 2019-03-09
Published Print: 2021-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Al-douri, Thekra
Hifi, Mhand http://orcid.org/0000-0002-1031-7701
Zissimopoulos, Vassilis
Text and Data Mining valid from 2019-03-09
Version of Record valid from 2019-03-09
Article History
Received: 13 May 2018
Revised: 28 October 2018
Accepted: 31 January 2019
First Online: 9 March 2019