The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
An Algorithm for Large Zero-One Knapsack Problems
Abstract
We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem equivalent to KP, defined on a particular subset of the variables. The size of this core is usually a small fraction of the full problem size, and does not seem to increase with the latter. While the core cannot be identified without solving KP, a satisfactory approximation can be found by solving the associated linear program (LKP). The second new ingredient is a binary search-type procedure for solving LKP which, unlike earlier methods, does not require any ordering of the variables. The computational effort involved in this procedure is linear in the number of variables. Finally, the third new feature is a simple heuristic which under certain conditions finds an optimal solution with a probability that increases with the size of KP. Computational experience with an algorithm based on the above ideas, on several hundred randomly generated test problems with 1,000–10,000 variables and with coefficients ranging from between 10 and 100 to between 10 and 10,000, indicates that for such problems the computational effort grows linearly with the number of variables and less than linearly with the range of coefficients. Average time per problem was less than a second, and the maximum time for any single problem was 3 seconds. Value-independent 0-1 knapsack problems (also randomly generated), were solved with a specialized version of the code in less than one-third of the time required for general 0-1 knapsack problems. To conclude, we identify a class of hard knapsack problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Computing Partitions with Applications to the Knapsack Problem
Horowitz, E., & Sahni, S. K. (1974) · Journal of the ACM · doi:10.1145/321812.321823 · Cited by 605
Chvátal, V. (1980) · Operations Research · doi:10.1287/opre.28.6.1402 · Cited by 130
Cited by
Algorithms for Knapsack Problems
Martello, S., & Toth, P. (1987) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73237-7 · Cited by 466
New trends in exact algorithms for the 0–1 knapsack problem
Martello, S., Pisinger, D., & Toth, P. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00260-x · Cited by 292
The zero/one multiple knapsack problem and genetic algorithms
Khuri, S., Bäck, T., & Heitkötter, J. (1994) · Proceedings of the 1994 ACM symposium on Applied computing - SAC '94 · doi:10.1145/326619.326694 · Cited by 259
A Minimal Algorithm for the 0-1 Knapsack Problem
Pisinger, D. (1997) · Operations Research · doi:10.1287/opre.45.5.758 · Cited by 253
Introducing a new intelligent adaptive learning content generation method
Haghshenas, E., Mazaheri, A., Gholipour, A., Tavakoli, M., Zandi, N., Narimani, H., Rahimi, F., & Nouri, S. (2010) · The Second International Conference on E-Learning and E-Teaching (ICELET 2010) · doi:10.1109/icelet.2010.5708382 · Cited by 14
Metadata
- Authors
- Balas, E., & Zemel, E.
- Venue
- Operations Research
- Published
- 1980-10
- Volume
- 28
- Issue
- 5
- Pages
- 1130-1154
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2017316844
- Cited by
- 469
- References
- 5
- FWCI
- 38.72
- Type
- journal article
- Language
- en
- Open access
- closed
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: An Algorithm for Large Zero-One Knapsack Problems. https://app.cochat.ai/papers/10.1287/opre.28.5.1130
- The paper
- Balas, E., & Zemel, E. (1980). An Algorithm for Large Zero-One Knapsack Problems. Operations Research. https://doi.org/10.1287/opre.28.5.1130
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.