Crossmark

Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application

Crossref DOI link: https://doi.org/10.1016/j.jksuci.2024.102093

Published Print: 2024-07

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Abdel-Basset, Mohamed

Mohamed, Reda

Saber, Safaa

Hezam, Ibrahim M. https://orcid.org/0000-0003-2747-6722
Sallam, Karam M. https://orcid.org/0000-0001-5767-2818
Hameed, Ibrahim A.
Funding

Funding for this research was provided by:

King Saud University
License Information

Text and Data Mining valid from 2024-07-01

Text and Data Mining valid from 2024-07-01

Version of Record valid from 2024-06-08
More Information

This article is maintained by: Elsevier

Article Title: Binary metaheuristic algorithms for 0–1 knapsack problems: Performance analysis, hybrid variants, and real-world application

Journal Title: Journal of King Saud University - Computer and Information Sciences

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.jksuci.2024.102093

Content Type: article

Copyright: © 2024 Published by Elsevier B.V. on behalf of King Saud University.