{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:07Z","timestamp":1725483727557},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_23","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:20:53Z","timestamp":1178371253000},"page":"301-314","source":"Crossref","is-referenced-by-count":4,"title":["On Logarithmic Simulated Annealing"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chak-Kuen","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"volume-title":"Simulated Annealing: Parallelization Techniques","year":"1992","key":"23_CR1","unstructured":"S. Azencott (editor). Simulated Annealing: Parallelization Techniques. Wiley & Sons, New York, 1992."},{"key":"23_CR2","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach","author":"E.H.L. Aarts","year":"1989","unstructured":"E.H.L. Aarts and J.H.M. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach, Wiley & Sons, New York, 1989."},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1006\/jcph.1997.5781","volume":"136","author":"A. Albrecht","year":"1997","unstructured":"A. Albrecht, S.K. Cheung, K.S. Leung, and C.K. Wong. Stochastic Simulations of Two-Dimensional Composite Packings. J. of Computational Physics, 136(2):559\u2013579, 1997.","journal-title":"J. of Computational Physics"},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1214\/aop\/1176989682","volume":"20","author":"O. Catoni","year":"1992","unstructured":"O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Applications to Exponential Schedules. Annals of Probability, 20(3):1109\u20131146, 1992.","journal-title":"Annals of Probability"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1006\/jcom.1996.0035","volume":"12","author":"O. Catoni","year":"1996","unstructured":"O. Catoni. Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments. J. of Complexity, 12(4):595\u2013623, 1996.","journal-title":"J. of Complexity"},{"key":"23_CR6","volume-title":"A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm","author":"V. \u010cerny","year":"1982","unstructured":"V. \u010cerny. A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm. Preprint, Inst. of Physics and Biophysics, Comenius Univ., Bratislava, 1982 (see also: J. Optim. Theory Appl., 45:41\u201351, 1985)."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"B. Hajek. Cooling Schedules for Optimal Annealing. Mathem. Oper. Res., 13:311\u2013329, 1988.","journal-title":"Mathem. Oper. Res."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"M. Kearns, M. Li, L. Pitt, and L.G. Valiant. Recent Results on Boolean Concept Learning. In Proc. 4\n                  \n                    th\n                  \n                  Int. Workshop on Machine Learning, pp. 337\u2013352, 1987.","DOI":"10.1016\/B978-0-934613-41-5.50037-4"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"issue":"6","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. Equation of State Calculations by Fast Computing Machines. J. of Chemical Physics, 21(6): 1087\u20131092, 1953.","journal-title":"J. of Chemical Physics"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(92)90177-H","volume":"99","author":"S. Rajasekaran","year":"1992","unstructured":"S. Rajasekaran and J.H. Reif. Nested Annealing: A Provable Improvement to Simulated Annealing. J. of Theoretical Computer Science, 99(1):157\u2013176, 1992.","journal-title":"J. of Theoretical Computer Science"},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01759049","volume":"6","author":"F. Romeo","year":"1991","unstructured":"F. Romeo and A. Sangiovanni-Vincentelli. A Theoretical Framework for Simulated Annealing. Algorithmica, vol. 6, no. 3, pp. 302\u2013345, 1991.","journal-title":"Algorithmica"},{"key":"23_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-32792-4","volume-title":"Non-negative Matrices and Markov Chains.","author":"E. Seneta","year":"1981","unstructured":"E. Seneta. Non-negative Matrices and Markov Chains. Springer-Verlag, New York, 1981."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A. Sinclair","year":"1989","unstructured":"A. Sinclair and M. Jerrum. Approximate Counting, Uniform Generation, and Rapidly Mixing Markov Chains. Information and Computation, 82:93\u2013133, 1989.","journal-title":"Information and Computation"},{"issue":"5","key":"23_CR15","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/0222066","volume":"22","author":"A. Sinclair","year":"1993","unstructured":"A. Sinclair and M. Jerrum. Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput., 22(5):1087\u20131116, 1993.","journal-title":"SIAM J. Comput."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01759051","volume":"6","author":"G. Sorkin","year":"1991","unstructured":"G. Sorkin. Efficient Simulated Annealing on Fractal Energy Landscapes. Algorithmica, 6:367\u2013418, 1991.","journal-title":"Algorithmica"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"K. Verbeurgt. Learning DNF under the Uniform Distribution in Quasi-Polynomial Time. In Proc. of the 3\n                  \n                    rd\n                  \n                  Annual Workshop on Computational Learning Theory, pp. 314\u2013326, 1990.","DOI":"10.1016\/B978-1-55860-146-8.50027-8"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:37:51Z","timestamp":1550327871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}