The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A genetic algorithm for the set covering problem
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
Performance of various computers using standard linear equations software
Dongarra, J. J. (1992) · ACM SIGARCH Computer Architecture News · doi:10.1145/141868.141871 · Cited by 708
Optimal Mutation Rates in Genetic Search
Bäck, T. (1993) · Cited by 368
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Fisher, M. L., & Kedia, P. (1990) · Management Science · doi:10.1287/mnsc.36.6.674 · Cited by 253
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 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
Self-citationXie, L., & Yuille, A. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.154 · Cited by 740
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
On the use of genetic algorithms to solve location problems
Jaramillo, J. H., Bhadury, J., & Batta, R. (2002) · Computers & Operations Research · doi:10.1016/s0305-0548(01)00021-1 · Cited by 312
Metadata
- Authors
- Beasley, J. E., & Chu, P. C.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 1996-10
- Volume
- 94
- Issue
- 2
- Pages
- 392-404
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2016929496
- Cited by
- 635
- References
- 3
- FWCI
- 8.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 genetic algorithm for the set covering problem. https://app.cochat.ai/papers/10.1016/0377-2217(95)00159-x
- The paper
- Beasley, J. E., & Chu, P. C. (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research. https://doi.org/10.1016/0377-2217(95)00159-x
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.