An Approximate Algorithm for Lexicographic Search in Multiple Orders for the Solution of the Multidimensional Boolean Knapsack Problem
Crossref DOI link: https://doi.org/10.1007/s10559-018-0057-5
Published Online: 2018-07-26
Published Print: 2018-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chupov, S. V.
Text and Data Mining valid from 2018-07-01
Article History
Received: 7 September 2017
First Online: 26 July 2018