The DOI matches its Crossref record.
A memetic algorithm for university exam timetabling
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
Memetic algorithms and memetic computing optimization: A literature review
Neri, F., & Cotta, C. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.11.003 · Cited by 680
A graph-based hyper-heuristic for educational timetabling problems
Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.08.012 · Cited by 507
Self-citationA 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
Meta-heuristics meet sports: A systematic review from the viewpoint of nature-inspired algorithms
Ariyaratne, M. K. A., & Silva, R. M. (2022) · International Journal of Computer Science in Sport · doi:10.2478/ijcss-2022-0003 · Cited by 19
Metadata
- Authors
- Burke, E. K., Newall, J. P., & Weare, R. F.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 241-250
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1817244122
- Cited by
- 240
- References
- 0
- FWCI
- 12.17
- Type
- conference paper
- 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 memetic algorithm for university exam timetabling. https://app.cochat.ai/papers/10.1007/3-540-61794-9_63
- The paper
- Burke, E. K., Newall, J. P., & Weare, R. F. (1996). A memetic algorithm for university exam timetabling. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-61794-9_63
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.