The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
Abstract
This paper presents an efficient solution algorithm for the multiconstraint zero-one knapsack problem through a branch and bound search process. The algorithm has been coded in FORTRAN; and a group of thirty 5-constraint knapsack problems with 30-90 variables were run on IBM 360/75 using two other codes as well, in order to compare the computational efficiency of the proposed method with that of the original Balas and an improved Balas additive algorithms. The computational results show that the proposed method is markedly faster with regard to the total as well as the individual solution times for these test problems, and such superiority becomes more evident as the number of variables and the difficulty of the problems increase. The results also indicated that the original Balas method is extremely inefficient for the type of problems being considered here. The total solution time for the thirty problems is 13 min for the proposed method, 109 min for the improved Balas algorithm, and over 380 min for the original Balas algorithm. Extension of the solution algorithm to the generalized knapsack problem is also suggested.
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
Cites
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
A Linear Programming Approach to the Cutting-Stock Problem
Gilmore, P. C., & Gomory, R. E. (1961) · Operations Research · doi:10.1287/opre.9.6.849 · Cited by 2,024
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
Optimization Techniques With FORTRAN
Kuester, J. L., Mize, J. H., & Griffin, D. S. (1974) · Journal of Applied Mechanics · doi:10.1115/1.3423205 · Cited by 1,051
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
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
The Theory and Computation of Knapsack Functions
Gilmore, P. C., & Gomory, R. E. (1966) · Operations Research · doi:10.1287/opre.14.6.1045 · Cited by 604
The knapsack problem: A survey
Salkin, H. M., & De Kluyver, C. A. (1975) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800220110 · Cited by 196
Some Applications of the Theory of Dynamic Programming—A Review
Bellman, R. (1954) · Journal of the Operations Research Society of America · doi:10.1287/opre.2.3.275 · Cited by 108
Shapiro, J. F. (1968) · Operations Research · doi:10.1287/opre.16.1.103 · Cited by 75
Cited by
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
Duan, C., Deng, C., Gharaei, A., Wu, J., & Wang, B. (2018) · International Journal of Production Research · doi:10.1080/00207543.2018.1436789 · Cited by 268
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
- Shih, W.
- Venue
- Journal of the Operational Research Society
- Publisher
- Informa UK Limited
- Published
- 1979-04
- Volume
- 30
- Issue
- 4
- Pages
- 369-378
- ISSN
- 0160-5682 (ISSN-L)
- 1476-9360
- OpenAlex
- W2043513057
- Cited by
- 257
- References
- 10
- FWCI
- 9.65
- 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: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem. https://app.cochat.ai/papers/10.1057/jors.1979.78
- The paper
- Shih, W. (1979). A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem. Journal of the Operational Research Society. https://doi.org/10.1057/jors.1979.78
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.