Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method
Crossref DOI link: https://doi.org/10.3103/S0027132221030050
Published Online: 2021-09-16
Published Print: 2021-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kolpakov, R. M.
Text and Data Mining valid from 2021-05-01
Version of Record valid from 2021-05-01
Article History
Received: 25 December 2019
Revised: 25 December 2019
Accepted: 25 December 2019
First Online: 16 September 2021