An efficient optimizer for the 0/1 knapsack problem using group counseling.

Ghadi YY, AlShloul T, Nezami ZI, Ali H, Asif M, Aljuaid H, Ahmad S

DOI: 10.7717/peerj-cs.1315
Published: 2023
Container: PeerJ. Computer science
Publisher: Not recorded
Open access: yes

Credibility signals

limited evidence Score 45/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. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
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. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.7717/peerj-cs.1315,
  title = {An efficient optimizer for the 0/1 knapsack problem using group counseling.},
  author = {Ghadi YY and AlShloul T and Nezami ZI and Ali H and Asif M and Aljuaid H and Ahmad S},
  year = {2023},
  journal = {PeerJ. Computer science},
  doi = {10.7717/peerj-cs.1315},
  url = {https://doi.org/10.7717/peerj-cs.1315}
}

RIS

TY  - JOUR
TI  - An efficient optimizer for the 0/1 knapsack problem using group counseling.
AU  - Ghadi YY
AU  - AlShloul T
AU  - Nezami ZI
AU  - Ali H
AU  - Asif M
AU  - Aljuaid H
AU  - Ahmad S
PY  - 2023
JO  - PeerJ. Computer science
DO  - 10.7717/peerj-cs.1315
UR  - https://doi.org/10.7717/peerj-cs.1315
ER  -

APA

YY, G., T, A., ZI, N., H, A., M, A., H, A., & S, A. (2023). An efficient optimizer for the 0/1 knapsack problem using group counseling.. PeerJ. Computer science. https://doi.org/10.7717/peerj-cs.1315

Source records

pubmed · retrieved 2026-09-25T22:00:01.645Z