article · Journal of King Saud University - Computer and Information Sciences

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

Mohamed Abdel‐Basset
Karam M. Sallam
Safaa Saber
Ibrahim M. Hezam
Reda Mohamed
Ibrahim A. Hameed

20248 citationsOpen accessZagazig University

In plain language

No abstract is available for this record, so no summary has been generated.

Research topics

Optimization and Packing Problems
Metaheuristic Optimization Algorithms Research
Optimization and Search Problems

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

View on publisher site Record on OpenAlex

DOI: 10.1016/j.jksuci.2024.102093

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.

New to MARATTO™? Create a free account.