Document is current

Any future updates will be listed below

Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem

Crossref DOI link: https://doi.org/10.1007/s10878-020-00584-2

Published Online: 2020-05-28

Published Print: 2020-07

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

About CrossMark