The DOI matches its Crossref record.
The knapsack problem: A survey
Open accessAbstract
A unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and xi ⩾ 0, integer; where vi, wi and W are known integers, and wi (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi‐dimensional case, are also considered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Algorithms for Knapsack Problems
Martello, S., & Toth, P. (1987) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73237-7 · Cited by 466
Gallo, G., Hammer, P. L., & Simeone, B. (1980) · Mathematical Programming Studies · doi:10.1007/bfb0120892 · Cited by 286
A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
Shih, W. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.78 · Cited by 257
Rethinking Serverless Keep-Alive by Decoupling Eviction Priority From Execution State
Gong, Y., Cai, X., Sang, Q., Lu, T., Hu, C., & Cheng, D. (2026) · IEEE Transactions on Computers · doi:10.1109/tc.2026.3699453
Metadata
- Authors
- Salkin, H. M., & De Kluyver, C. A.
- Venue
- Naval Research Logistics Quarterly
- Publisher
- Wiley
- Published
- 1975-03
- Volume
- 22
- Issue
- 1
- Pages
- 127-144
- ISSN
- 0028-1441 (ISSN-L)
- 1931-9193
- OpenAlex
- W2072803231
- Cited by
- 196
- References
- 0
- FWCI
- 28.36
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The knapsack problem: A survey. https://app.cochat.ai/papers/10.1002/nav.3800220110
- The paper
- Salkin, H. M., & De Kluyver, C. A. (1975). The knapsack problem: A survey. Naval Research Logistics Quarterly. https://doi.org/10.1002/nav.3800220110
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.