{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:24Z","timestamp":1725664704376},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616801"},{"type":"electronic","value":"9783540706670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61680-2_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:11:05Z","timestamp":1330294265000},"page":"138-151","source":"Crossref","is-referenced-by-count":6,"title":["Simulated Annealing and its problems to color graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Nolte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Schrader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.; Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18, 1979","DOI":"10.1016\/0022-0000(79)90045-X"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Anily, S. and Federgruen, A.: Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods, Oper. Res. 35, 1987","DOI":"10.1287\/opre.35.6.867"},{"key":"11_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-49686-8","volume-title":"Markov chains with stationary transition probabilities","author":"K.L. Chung","year":"1960","unstructured":"Chung, K.L.: Markov chains with stationary transition probabilities, Springer Verlag, Heidelberg, 1960."},{"key":"11_CR4","unstructured":"Garey, M.R.; Johnson, S. J.: Computers and Intractability, W.H. Freeman and Company, 1979"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gidas, B.: Nonstationary Markov Chains and Convergence of the Annealing Algorithm, J. Statis. Phys. 39, 1985","DOI":"10.1007\/BF01007975"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Hajek, B.: Hitting Time and Occupation-Time Bounds Implied By Drift Analysis With Applications, Advanced Applied Probability 14, 1982","DOI":"10.2307\/1426671"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hajek, B.: Cooling Schedules for Optimal Annealing, Mathematics of Operations Research 13, 1988","DOI":"10.1287\/moor.13.2.311"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Large Cliques elude the Metropolis Process, Random Structures and Algorithms 3, 1992","DOI":"10.1002\/rsa.3240030402"},{"key":"11_CR9","unstructured":"Jerrum, J; Sinclair, A.: Approximating the permanent, Proceedings of the 20th ACM-Symposium on Theory of Computing, 1988."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, D.S. et al.: Optimization by Simulated Annealing: An Experimental Evaluation, Operations Research 39, 1991","DOI":"10.1287\/opre.39.3.378"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P.: Optimization by Simulated Annealing, Science 220, 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"11_CR12","unstructured":"Laarhoven, P.J.M.; Aarts, E.H.L.: Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, 1989."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Metropolis, N. et al.: Equations of state calculations by fast computer machines, Journal of Chemical Physics 21, 1953","DOI":"10.2172\/4390578"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Mihail, M.: Conductance and Convergence of Markov chains-A combinatorial treatment of expanders, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989.","DOI":"10.1109\/SFCS.1989.63529"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Mitra, D.; Romeo, F.; Sangiovanni-Vincentelli, A.L.: Convergence and Finite Time Behaviour of Simulated Annealing, Adv. Appl. Prob. 18, 1986","DOI":"10.1017\/S0001867800016050"},{"key":"11_CR16","unstructured":"Nolte, A.; Schrader, R.: Simulated Annealing for Graph coloring, Technical report, University of Cologne, in preparation"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Sasaki, G.H.; Hajek, B.: The Time Complexity of Maximum Matching by Simulated Annealing, Journal of the Association for Computing Machinery 35, 1988","DOI":"10.1145\/42282.46160"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Tsitsiklis, J.: Markov Chains with Rare Transitions and Simulated Annealing, Mathematics of Operations Research 14, 1989","DOI":"10.1287\/moor.14.1.70"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61680-2_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:11Z","timestamp":1605647351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61680-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616801","9783540706670"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61680-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}