Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming
Crossref DOI link: https://doi.org/10.3103/S0146411615040082
Published Online: 2015-09-02
Published Print: 2015-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Mamedov, K. Sh.
Mamedov, K. K.
Elchueva, S. K.
Text and Data Mining valid from 2015-07-01