Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.

Wang Z, Zhang H, Li Y.

DOI: 10.1155/2022/1266529
Published: 2022-10-22
Container: Comput Intell Neurosci
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.1155/2022/1266529,
  title = {Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.},
  author = {Wang Z and  Zhang H and  Li Y.},
  year = {2022},
  journal = {Comput Intell Neurosci},
  doi = {10.1155/2022/1266529},
  url = {https://doi.org/10.1155/2022/1266529}
}

RIS

TY  - JOUR
TI  - Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.
AU  - Wang Z
AU  -  Zhang H
AU  -  Li Y.
PY  - 2022
JO  - Comput Intell Neurosci
DO  - 10.1155/2022/1266529
UR  - https://doi.org/10.1155/2022/1266529
ER  -

APA

Z, W., H, Z., & Y., L. (2022). Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.. Comput Intell Neurosci. https://doi.org/10.1155/2022/1266529

Source records

europe-pmc · retrieved 2026-11-10T09:41:27.609Z