A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications
- DOI
- 10.1016/j.aej.2023.09.072
- Published
- 11
- Container
- Alexandria Engineering Journal
- Publisher
- Not recorded
- Open access
- yes
Credibility signals
uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- cautionDOI registered: No matching Crossref record was present in this response.
- cautionDOI resolves: No matching Crossref record was present in this response.
- supportingDirectory of Open Access Journals: A matching record was returned by DOAJ.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- supportingOpen access status: Normalized open-access status: open.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty.
Cite this work
BibTeX
@article{allodium:10.1016/j.aej.2023.09.072,
title = {A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications},
author = {Mohamed Abdel-Basset and Reda Mohamed and Ibrahim M. Hezam and Karam M. Sallam and Ahmad M. Alshamrani and Ibrahim A. Hameed},
year = {2023},
journal = {Alexandria Engineering Journal},
doi = {10.1016/j.aej.2023.09.072},
url = {https://doi.org/10.1016/j.aej.2023.09.072}
}RIS
TY - JOUR TI - A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications AU - Mohamed Abdel-Basset AU - Reda Mohamed AU - Ibrahim M. Hezam AU - Karam M. Sallam AU - Ahmad M. Alshamrani AU - Ibrahim A. Hameed PY - 2023 JO - Alexandria Engineering Journal DO - 10.1016/j.aej.2023.09.072 UR - https://doi.org/10.1016/j.aej.2023.09.072 ER -
APA
Abdel-Basset, M., Mohamed, R., Hezam, I. M., Sallam, K. M., Alshamrani, A. M., & Hameed, I. A. (2023). A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications. Alexandria Engineering Journal. https://doi.org/10.1016/j.aej.2023.09.072
Source records
- doaj · retrieved 2026-09-25T05:22:08.086Z