Crossmark

Branch-and-Bound and Dynamic Programming Approaches for the Knapsack Problem

Crossref DOI link: https://doi.org/10.1007/s43069-024-00372-2

Published Online: 2024-10-17

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Burashnikov, Evgenii https://orcid.org/0000-0002-0838-0250
License Information

Text and Data Mining valid from 2024-10-17

Version of Record valid from 2024-10-17
More Information

Article History

Received: 27 June 2024

Accepted: 11 September 2024

First Online: 17 October 2024

Declarations

:

: The authors declare no competing interests.