The DOI matches its OpenAlex record.
Knapsack Problems: Algorithms and Computer Implementations
Abstract
Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem generalized assignment problem bin packing problem. Appendix: computer codes.
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
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
QoS-aware middleware for Web services composition
Zeng, L., Benatallah, B., Ngu, A. H. H., Dumas, M., Kalagnanam, J., & Chang, H. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.11 · Cited by 2,757
Multiobjective optimization using evolutionary algorithms — A comparative case study
Zitzler, E., & Thiele, L. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056872 · Cited by 2,262
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
The vehicle routing problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90192-c · Cited by 1,749
EXPERT SYSTEMS WITH APPLICATIONS
(2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.10.010 · Cited by 1,656
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Facility location models for distribution system design
Klose, A., & Drexl, A. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2003.10.031 · Cited by 965
Two-dimensional packing problems: A survey
Lodi, A., Martello, S., & Monaci, M. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00123-6 · Cited by 843
Self-citationA 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
Optimal Allocation of Resources among Threatened Species: a Project Prioritization Protocol
JOSEPH, L. N., MALONEY, R. F., & POSSINGHAM, H. P. (2009) · Conservation Biology · doi:10.1111/j.1523-1739.2008.01124.x · Cited by 595
Multicasting in delay tolerant networks: a social network perspective
Gao, W., Li, Q., Zhao, B., & Cao, G. (2009) · Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1530748.1530790 · Cited by 537
Willighagen, E. L., Mayfield, J. W., Alvarsson, J., Berg, A., Carlsson, L., Jeliazkova, N., Kuhn, S., Pluskal, T., Rojas-Chertó, M., Spjuth, O., et al. (2017) · Journal of Cheminformatics · doi:10.1186/s13321-017-0220-4 · Cited by 527
FSD50K: An Open Dataset of Human-Labeled Sound Events
Fonseca, E., Favory, X., Pons, J., Font, F., & Serra, X. (2020) · arXiv · doi:10.48550/arxiv.2010.00475 · Cited by 462
FSD50K: An Open Dataset of Human-Labeled Sound Events
Fonseca, E., Favory, X., Pons, J., Font, F., & Serra, X. (2022) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2021.3133208 · Cited by 449
Evaluating evolutionary algorithms
Whitley, D., Rana, S., Dzubera, J., & Mathias, K. E. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00124-7 · Cited by 406
Bin packing and cutting stock problems: Mathematical models and exact algorithms
Delorme, M., Iori, M., & Martello, S. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.04.030 · Cited by 379
Self-citationSIRIUS: decomposing isotope patterns for metabolite identification
Böcker, S., Letzel, M. C., Lipták, Z., & Pervukhin, A. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btn603 · Cited by 354
Multi-UAV-Enabled Load-Balance Mobile-Edge Computing for IoT Networks
Yang, L., Yao, H., Wang, J., Jiang, C., Benslimane, A., & Liu, Y. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2971645 · Cited by 352
TimeAware test suite prioritization
Walcott, K. R., Soffa, M. L., Kapfhammer, G. M., & Roos, R. S. (2006) · Proceedings of the 2006 international symposium on Software testing and analysis · doi:10.1145/1146238.1146240 · Cited by 340
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Chekuri, C., & Khanna, S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539700382820 · Cited by 332
Setting Conservation Priorities
Wilson, K. A., Carwardine, J., & Possingham, H. P. (2009) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.2009.04149.x · Cited by 324
A survey of recent developments in multiobjective optimization
Chinchuluun, A., & Pardalos, P. M. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0186-0 · Cited by 323
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
Self-citationVanderbeck, F. (2000) · Operations Research · doi:10.1287/opre.48.1.111.12453 · Cited by 291
Mann, Z. Á. (2015) · ACM Computing Surveys · doi:10.1145/2797211 · Cited by 274
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
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
Context-Aware Online Adaptation of Mixed Reality Interfaces
Lindlbauer, D., Feit, A. M., & Hilliges, O. (2019) · Proceedings of the 32nd Annual ACM Symposium on User Interface Software and Technology · doi:10.1145/3332165.3347945 · Cited by 254
A Minimal Algorithm for the 0-1 Knapsack Problem
Pisinger, D. (1997) · Operations Research · doi:10.1287/opre.45.5.758 · Cited by 253
Vasquez, M., & Hao, J.-K. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011203002719 · Cited by 239
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Evolving Bin Packing Heuristics with Genetic Programming
Burke, E. K., Hyde, M. R., & Kendall, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11844297_87 · Cited by 144
An efficient power scheduling scheme for residential load management in smart homes
Rasheed, M., Javaid, N., Ahmad, A., Khan, Z., Qasim, U., & Alrajeh, N. (2015) · Applied Sciences · doi:10.3390/app5041134 · Cited by 134
Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277273 · Cited by 121
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Shi, R., Zhang, J., Chu, W., Bao, Q., Jin, X., Gong, C., Zhu, Q., Yu, C., & Rosenberg, S. (2015) · 2015 IEEE International Conference on Services Computing · doi:10.1109/scc.2015.19 · Cited by 74
Providing a memory mechanism to enhance the evolutionary design of heuristics
Burke, E. K., Hyde, M. R., & Kendall, G. (2010) · IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2010.5586388 · Cited by 15
Weibull-Based Benchmarks for Bin Packing
Castiñeiras, I., De Cauwer, M., & O’Sullivan, B. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33558-7_17 · Cited by 14
Metadata
- Authors
- Connolly, D., Martello, S., & Toth, P.
- Venue
- Journal of the Operational Research Society
- Publisher
- Palgrave Macmillan
- Published
- 1991-06-01
- Volume
- 42
- Issue
- 6
- Pages
- 513-513
- ISSN
- 0160-5682 (ISSN-L)
- OpenAlex
- W2066671865
- Cited by
- 3,120
- References
- 0
- FWCI
- 58.28
- 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
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.