Crossmark

An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem

Crossref DOI link: https://doi.org/10.1007/s00366-021-01470-z

Published Online: 2021-07-19

Published Print: 2022-10

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

Authors

Abdollahzadeh, Benyamin https://orcid.org/0000-0003-3618-6620
Barshandeh, Saeid

Javadi, Hatef

Epicoco, Nicola
License Information

Text and Data Mining valid from 2021-07-19

Version of Record valid from 2021-07-19
More Information

Article History

Received: 18 February 2021

Accepted: 1 July 2021

First Online: 19 July 2021