Fast Solution Methods for the Classical 0–1 Knapsack Problem
- DOI
- 10.17613/ttrnk-0vc38
- Published
- 2026
- Container
- Not recorded
- Publisher
- Resp AI Research Lab, CIIOE
- Open access
- yes
Credibility signals
limited evidence Score 47/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.
- 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.
- 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.
- supportingPublication license: A publication license was supplied: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode. Presence improves reuse transparency, not research validity.
- 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.17613/ttrnk-0vc38,
title = {Fast Solution Methods for the Classical 0–1 Knapsack Problem},
author = {Feng, Hsu},
year = {2026},
doi = {10.17613/ttrnk-0vc38},
url = {https://doi.org/10.17613/ttrnk-0vc38}
}RIS
TY - JOUR TI - Fast Solution Methods for the Classical 0–1 Knapsack Problem AU - Feng, Hsu PY - 2026 DO - 10.17613/ttrnk-0vc38 UR - https://doi.org/10.17613/ttrnk-0vc38 ER -
APA
Hsu, F. (2026). Fast Solution Methods for the Classical 0–1 Knapsack Problem. https://doi.org/10.17613/ttrnk-0vc38