The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A Survey of Automated Timetabling
Open accessOverview
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
New methods to color the vertices of a graph
Brélaz, D. (1979) · Communications of the ACM · doi:10.1145/359094.359101 · Cited by 1,567
Heuristics: Intelligent search strategies for computer problem solving.
(1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90100-1 · Cited by 1,430
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
On the Complexity of Timetable and Multicommodity Flow Problems
Even, S., Itai, A., & Shamir, A. (1976) · SIAM Journal on Computing · doi:10.1137/0205048 · Cited by 1,057
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
An upper bound for the chromatic number of a graph and its application to timetabling problems
Welsh, D. J. A. (1967) · The Computer Journal · doi:10.1093/comjnl/10.1.85 · Cited by 762
Using tabu search techniques for graph coloring
Hertz, A., & de Werra, D. (1987) · Computing · doi:10.1007/bf02239976 · Cited by 657
A graph coloring algorithm for large scheduling problems
Leighton, F. T. (1979) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.084.024 · Cited by 491
Combinatorial optimization: algorithms and complexity
Papadimitriou, C. H., & Steiglitz, K. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 486
A still better performance guarantee for approximate graph coloring
Halldórsson, M. M. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90246-6 · Cited by 224
Timetabling in constraint logic programming
Kambi, M., & Gilbert, D. (1996) · Brunel University Research Archive (BURA) (Brunel University London) · Cited by 33
Timetabling through a deductive database: A case study
Monfroglio, A. (1988) · Data & Knowledge Engineering · doi:10.1016/0169-023x(88)90002-x · Cited by 25
Cited by
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
Metadata
- Authors
- Schaerf, A.
- Venue
- Artificial Intelligence Review
- Published
- 1999-04
- Volume
- 13
- Issue
- 2
- Pages
- 87-127
- ISSN
- 0269-2821 (ISSN-L)
- 1573-7462
- OpenAlex
- W1506559586
- Cited by
- 654
- References
- 20
- FWCI
- 11.14
- Type
- journal article
- Language
- en
- Open access
- green
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.