{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:47:43Z","timestamp":1648673263164},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,13]],"date-time":"2006-07-13T00:00:00Z","timestamp":1152748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s00607-006-0167-1","type":"journal-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T10:58:50Z","timestamp":1152529130000},"page":"55-79","source":"Crossref","is-referenced-by-count":9,"title":["A Stopping Criterion for Logarithmic Simulated Annealing"],"prefix":"10.1007","volume":"78","author":[{"given":"Andreas A.","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"167_CR1","volume-title":"Local search in combinatorial optimization","author":"E. H. L. Aarts","year":"1998"},{"key":"167_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, A.: On the complexity to approach optimum solutions by inhomogeneous Markov chains. In: Proc. Genetic and Evolutionary Computation Conference (GECCO'04), LNCS vol. 3102. Berlin: Springer 2004, pp. 642\u2013653.","DOI":"10.1007\/978-3-540-24854-5_67"},{"key":"167_CR3","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1142\/S0218001402001848","volume":"16","author":"A. Albrecht","year":"2002","journal-title":"Int. J. Pattern. Recogn. Artif. Intell."},{"key":"167_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0933-3657(03)00036-8","volume":"28","author":"A. Albrecht","year":"2003","journal-title":"Artif. Intell. Med."},{"key":"167_CR5","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1214\/aop\/1176989682","volume":"20","author":"O. Catoni","year":"1992","journal-title":"Ann. Probability"},{"key":"167_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. \u010cerny","year":"1985","journal-title":"J. Optim. Theor. Appl."},{"key":"167_CR7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1012487302797","volume":"46","author":"I. Guyon","year":"2002","journal-title":"Machine Learning"},{"key":"167_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","journal-title":"Math. Oper. Res."},{"key":"167_CR9","unstructured":"Hart, W. E.: A theoretical comparison of evolutionary algorithms and simulated annealing. In: Proc. 5th Annual Conf. on Evolutionary Programming. Cambridge, MA: MIT Press 1996, pp. 147\u2013154."},{"key":"167_CR10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"167_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1142\/S0218213006002606","volume":"15","author":"G. Lappas","year":"2006","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"167_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P. Merz","year":"2000","journal-title":"Evol. Comput."},{"key":"167_CR13","unstructured":"Merz, P.: An iterated local search approach for minimum sum-of-squares clustering. In: Proc. Adv. Intelligent Data Analysis V, LNCS vol. 2810. Berlin: Springer 2003, pp. 286\u2013296."},{"key":"167_CR14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"167_CR15","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718300","volume-title":"Facts, conjectures, and improvements for simulated annealing","author":"P. Salomon","year":"2002"},{"key":"167_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00406-0","volume":"259","author":"L. M. Schmitt","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"167_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(99)00263-7","volume":"241","author":"P.-M.-B. Vitanyi","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"167_CR18","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1088\/0305-4470\/37\/17\/005","volume":"37","author":"M. T. Wolfinger","year":"2004","journal-title":"J. Phys. A \u2013 Mathematical General"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-006-0167-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-006-0167-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-006-0167-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:30:19Z","timestamp":1559125819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-006-0167-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,13]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s00607-006-0167-1","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,13]]}}}