The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Convergence of an annealing algorithm
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
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
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,168
Nonnegative Matrices in the Mathematical Sciences
(1979) · Elsevier eBooks · doi:10.1016/c2013-0-10361-3 · Cited by 5,451
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807
Reversibility and Stochastic Networks
Cohen, J. E., & Kelly, F. P. (1981) · Technometrics · doi:10.1080/00401706.1981.10486278 · Cited by 2,212
Reversibility and Stochastic Networks
Unwin, A. (1980) · Journal of the Operational Research Society · doi:10.1057/jors.1980.173 · Cited by 1,529
Cited by
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Discovering regulatory and signalling circuits in molecular interaction networks
Ideker, T., Ozier, O., Schwikowski, B., & Siegel, A. F. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_1.s233 · Cited by 1,197
Job Shop Scheduling by Simulated Annealing
van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992) · Operations Research · doi:10.1287/opre.40.1.113 · Cited by 1,123
Accelerating the convergence of the back-propagation method
Vogl, T. P., Mangis, J. K., Rigler, A. K., Zink, W. T., & Alkon, D. L. (1988) · Biological Cybernetics · doi:10.1007/bf00332914 · Cited by 1,094
Simulated annealing: A tool for operational research
Eglese, R. W. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90001-r · Cited by 801
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Hwang, F. K., & Richards, D. S. (1992) · Networks · doi:10.1002/net.3230220105 · Cited by 663
Simulated annealing for permutation flow-shop scheduling
Osman, I., & Potts, C. (1989) · Omega · doi:10.1016/0305-0483(89)90059-5 · Cited by 614
A survey of simulated annealing as a tool for single and multiobjective optimization
Suman, B., & Kumar, P. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602068 · Cited by 611
New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
Storer, R. H., Wu, S. D., & Vaccari, R. (1992) · Management Science · doi:10.1287/mnsc.38.10.1495 · Cited by 546
The TimberWolf placement and routing package
Sechen, C., & Sangiovanni-Vincentelli, A. (1985) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1985.1052337 · Cited by 532
The Theory and Practice of Simulated Annealing
Henderson, D., Jacobson, S. H., & Johnson, A. W. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_10 · Cited by 514
New International Formulation for the Viscosity of H2O
Huber, M. L., Perkins, R. A., Laesecke, A., Friend, D. G., Sengers, J. V., Assael, M. J., Metaxa, I. N., Vogel, E., Mareš, R., & Miyagawa, K. (2009) · Journal of Physical and Chemical Reference Data · doi:10.1063/1.3088050 · Cited by 506
An improved annealing scheme for the QAP
Connolly, D. T. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90301-q · Cited by 400
Unit commitment by simulated annealing
Zhuang, F., & Galiana, F. D. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.49122 · Cited by 383
Optimization Using Simulated Annealing
Brooks, S. P., & Morgan, B. J. T. (1995) · The Statistician · doi:10.2307/2348448 · Cited by 348
Kuo, Y. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2010.03.012 · Cited by 343
Bagnall, A. J., Rayward-Smith, V. J., & Whittley, I. M. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00194-x · Cited by 311
Ogbu, F. A., & Smith, D. K. (1990) · Computers & Operations Research · doi:10.1016/0305-0548(90)90001-n · Cited by 310
Dynamic network design for reverse logistics operations under uncertainty
Lee, D.-H., & Dong, M. (2009) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2008.08.002 · 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
Mathematical Methods for Spatially Cohesive Reserve Design
McDonnell, M. D., Possingham, H. P., Ball, I. R., & Cousins, E. A. (2002) · Environmental Modeling & Assessment · doi:10.1023/a:1015649716111 · Cited by 253
A steady-state genetic algorithm for multi-product supply chain network design
Altiparmak, F., Gen, M., Lin, L., & Karaoglan, I. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.05.012 · Cited by 252
3D Face Recognition Using Simulated Annealing and the Surface Interpenetration Measure
Queirolo, C. C., Silva, L., Bellon, O. R. P., & Segundo, M. P. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.14 · Cited by 201
Metadata
- Authors
- Lundy, M., & Mees, A.
- Venue
- Mathematical Programming
- Published
- 1986-01
- Volume
- 34
- Issue
- 1
- Pages
- 111-124
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2047422346
- Cited by
- 693
- References
- 11
- FWCI
- 16.27
- 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.