The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
A Genetic Algorithm for the Multidimensional Knapsack Problem
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Knapsack Problems: Algorithms and Computer Implementations
Connolly, D., Martello, S., & Toth, P. (1991) · Journal of the Operational Research Society · doi:10.2307/2583458 · Cited by 3,120
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
OR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1057/jors.1990.166 · Cited by 1,899
Self-citationKnapsack problems, algorithms and computer implementations
De Kort, J. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90159-s · Cited by 1,402
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Glover, F. (1977) · Decision Sciences · doi:10.1111/j.1540-5915.1977.tb01074.x · Cited by 1,363
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Everett, H. (1963) · Operations Research · doi:10.1287/opre.11.3.399 · Cited by 1,274
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Discrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
An overview of genetic algorithms: Part 1, fundamentals
Beasley, D. W. C., Bull, D., & Martin, R. R. (1993) · Bristol Research (University of Bristol) · Cited by 797
Dueck, G. (1993) · Journal of Computational Physics · doi:10.1006/jcph.1993.1010 · Cited by 765
A genetic algorithm for the set covering problem
Beasley, J. E., & Chu, P. C. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00159-x · Cited by 635
Self-citationThe 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
Holland, J. H. (1975) · Cited by 585
A Genetic Algorithm for the Set Covering Problem
Al-Sultan, K. S., Hussain, M. F., & Nizami, J. S. (1996) · Journal of the Operational Research Society · doi:10.1057/jors.1996.82 · Cited by 551
Handbook of Evolutionary Computation
(1997) · CRC Press eBooks · doi:10.1201/9780367802486 · Cited by 413
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
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
Pivot and Complement–A Heuristic for 0-1 Programming
Balas, E., & Martin, C. H. (1980) · Management Science · doi:10.1287/mnsc.26.1.86 · Cited by 257
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
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Gavish, B., & Pirkul, H. (1985) · Mathematical Programming · doi:10.1007/bf02591863 · Cited by 225
Critical Event Tabu Search for Multidimensional Knapsack Problems
Glover, F., & Kochenberger, G. A. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_25 · Cited by 189
An efficient tabu search approach for the 0–1 multidimensional knapsack problem
Hanafi, S., & Fréville, A. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00296-8 · Cited by 186
A heuristic solution procedure for the multiconstraint zero-one knapsack problem
Pirkul, H. (1987) · Naval Research Logistics (NRL) · doi:10.1002/1520-6750(198704)34:2<161::aid-nav3220340203>3.0.co;2-a · Cited by 166
A simulated annealing approach to the multiconstraint zero-one knapsack problem
Drexl, A. (1988) · Computing · doi:10.1007/bf02242185 · Cited by 164
The noising method: a new method for combinatorial optimization
Charon, I., & Hudry, O. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90023-a · Cited by 160
Solving zero-one mixed integer programming problems using tabu search
Løkketangen, A., & Glover, F. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00295-6 · Cited by 137
Dynamic tabu list management using the reverse elimination method
Dammeyer, F., & Voß, S. (1993) · Annals of Operations Research · doi:10.1007/bf02022561 · Cited by 114
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
Fréville, A., & Plateau, G. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90209-7 · Cited by 113
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1008668508685 · Cited by 101
Self-citationHeuristics and reduction methods for multiple constraints 0–1 linear programming problems
Fréville, A., & Plateau, G. (1986) · European Journal of Operational Research · doi:10.1016/0377-2217(86)90042-1 · Cited by 80
A cellular genetic algorithm with self-adjusting acceptance threshold
Rudolph, G. (1995) · doi:10.1049/cp:19951076 · Cited by 47
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
Fr�ville, A., & Plateau, G. (1996) · Journal of Heuristics · doi:10.1007/bf00247210 · Cited by 43
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem
Hanafi, S., Fréville, A., & Abdellaoui, A. (1996) · Springer eBooks · doi:10.1007/978-1-4613-1361-8_27 · Cited by 26
Cited by
Heuristics for cardinality constrained portfolio optimisation
Chang, T.-J., Meade, N., Beasley, J. E., & Sharaiha, Y. M. (2000) · Computers & Operations Research · doi:10.1016/s0305-0548(99)00074-x · Cited by 926
Self-citationA competitive genetic algorithm for resource-constrained project scheduling
Hartmann, S. (1998) · Naval Research Logistics · doi:10.1002/(sici)1520-6750(199810)45:7<733::aid-nav5>3.0.co;2-c · Cited by 568
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_5 · Cited by 457
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2030331 · Cited by 423
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
Metadata
- Authors
- Chu, P. C., & Beasley, J. E.
- Venue
- Journal of Heuristics
- Published
- 1998-06
- Volume
- 4
- Issue
- 1
- Pages
- 63-86
- ISSN
- 1381-1231 (ISSN-L)
- 1572-9397
- OpenAlex
- W1586409345
- Cited by
- 828
- References
- 38
- FWCI
- 55.84
- 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.