The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Algorithms for Knapsack Problems
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
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
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
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
Data Structures and Algorithms
Wirth, N. (1984) · Scientific American · doi:10.1038/scientificamerican0984-60 · Cited by 1,418
A Linear Programming Approach to the Cutting Stock Problem—Part II
Gilmore, P. C., & Gomory, R. E. (1963) · Operations Research · doi:10.1287/opre.11.6.863 · Cited by 1,119
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Ibarra, O. H., & Kim, C. E. (1975) · Journal of the ACM · doi:10.1145/321906.321909 · Cited by 959
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
Multistage Cutting Stock Problems of Two and More Dimensions
Gilmore, P. C., & Gomory, R. E. (1965) · Operations Research · doi:10.1287/opre.13.1.94 · Cited by 809
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
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
An Algorithm for Large Zero-One Knapsack Problems
Balas, E., & Zemel, E. (1980) · Operations Research · doi:10.1287/opre.28.5.1130 · Cited by 469
Fast Approximation Algorithms for Knapsack Problems
Lawler, E. L. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.4.339 · Cited by 411
Mathematical Programming and the Analysis of Capital Budgeting Problems.
Anderson, M., & Weingartner, H. M. (1964) · The Journal of Finance · doi:10.2307/2977139 · Cited by 406
Approximate Algorithms for the 0/1 Knapsack Problem
Sahni, S. (1975) · Journal of the ACM · doi:10.1145/321864.321873 · Cited by 349
Capital Budgeting of Interrelated Projects: Survey and Synthesis
Weingartner, H. M. (1966) · Management Science · doi:10.1287/mnsc.12.7.485 · Cited by 296
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
Chvátal, V. (1980) · Operations Research · doi:10.1287/opre.28.6.1402 · Cited by 130
Heuristic algorithms for the multiple knapsack problem
Martello, S., & Toth, P. (1981) · Computing · doi:10.1007/bf02243544 · Cited by 82
Self-citation
Cited by
Energy Efficient Dynamic Offloading in Mobile Edge Computing for Internet of Things
Chen, Y., Zhang, N., Zhang, Y., Chen, X., Wu, W., & Shen, X. (2021) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2019.2898657 · Cited by 293
A Minimal Algorithm for the 0-1 Knapsack Problem
Pisinger, D. (1997) · Operations Research · doi:10.1287/opre.45.5.758 · Cited by 253
Optimal Schedule of Mobile Edge Computing for Internet of Things Using Partial Information
Lyu, X., Ni, W., Tian, H., Liu, R. P., Wang, X., Giannakis, G. B., & Paulraj, A. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760186 · Cited by 251
Diet code is healthy: simplifying programs for pre-trained models of code
Zhang, Z., Zhang, H., Shen, B., & Gu, X. (2022) · Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3540250.3549094 · Cited by 41
Lo, V. S. Y., & Pachamanova, D. A. (2015) · Journal of Marketing Analytics · doi:10.1057/jma.2015.5 · Cited by 28
Metadata
- Authors
- Martello, S., & Toth, P.
- Venue
- North-Holland Mathematics Studies
- Publisher
- Elsevier
- Published
- 1987
- Pages
- 213-257
- ISSN
- 0304-0208 (ISSN-L)
- OpenAlex
- W1776713878
- Cited by
- 466
- References
- 22
- FWCI
- 17.96
- Type
- book chapter
- 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
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.