{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:29Z","timestamp":1725491789851},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755135"},{"type":"electronic","value":"9783540755142"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75514-2_8","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T06:34:24Z","timestamp":1190183664000},"page":"96-107","source":"Crossref","is-referenced-by-count":2,"title":["On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case"],"prefix":"10.1007","author":[{"given":"Rhydian","family":"Lewis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"van Hoeve, W.J.: The alldifferent constraint: A survey. CoRR cs.PL\/0105015 (2001)"},{"key":"8_CR2","unstructured":"Simonis, H.: Sudoku as a constraint problem. In: Hnich, B., Prosser, P., Smith, B. (eds.) Proc. 4th Int. Works. Modelling and Reformulating Constraint Satisfaction Problems, pp. 13\u201327 (2005)"},{"issue":"5","key":"8_CR3","first-page":"1052","volume":"EA6-A","author":"T. Yato","year":"2003","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundamentals\u00a0EA6-A(5), 1052\u20131060 (2003)","journal-title":"IEICE Trans. Fundamentals"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Lewis, R.: In press: Metaheuristics can solve sudoku puzzles. Journal of heuristics\u00a013 (2007)","DOI":"10.1007\/s10732-007-9012-8"},{"key":"8_CR5","first-page":"100","volume-title":"11th European Conference on Artificial Intelligence","author":"B. Smith","year":"1994","unstructured":"Smith, B.: Phase transitions and the mushy region in constraint satisfaction problems. In: Cohn, A. (ed.) 11th European Conference on Artificial Intelligence, pp. 100\u2013104. John Wiley and Sons ltd., Chichester (1994)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"J.S. Turner","year":"1988","unstructured":"Turner, J.S.: Almost all k-colorable graphs are easy to color. Journal of Algorithms\u00a09, 63\u201382 (1988)","journal-title":"Journal of Algorithms"},{"key":"8_CR7","unstructured":"Felgenhauer, B., Jarvis, F.: Mathematics of sudoku. Online Resource: (2006), \n                  \n                    http:\/\/www.afjarvis.staff.shef.ac.uk\/sudoku\/"},{"key":"8_CR8","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: IJCAI-1991. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, Sidney, Australia, pp. 331\u2013337 (1991)"},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P. Laarhoven van","year":"1987","unstructured":"van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. D. Reidel Publishing Company, Dordrecht (1987)"},{"key":"8_CR10","unstructured":"Mepham, M.: Sudoku archive. Online (2006), \n                  \n                    http:\/\/www.sudoku.org.uk\/backpuzzles.htm"},{"key":"8_CR11","unstructured":"Royle, G.: Minimum sudoku. Online (2006), \n                  \n                    http:\/\/www.csse.uwa.edu.au\/~gordon\/sudokumin.php"},{"key":"8_CR12","unstructured":"Hanssen, V.: Sudoku puzzles. Online (2006), \n                  \n                    http:\/\/www.menneske.no\/sudoku\/eng\/"},{"key":"8_CR13","unstructured":"Armstrong, S.: Sudoku solving techniques. Online (2006), \n                  \n                    http:\/\/www.sadmansoftware.com\/sudoku\/techniques.htm"},{"key":"8_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032497","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1994","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems, 1st edn. Wiley-Interscience, Chichester (1994)","edition":"1"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Practice and Theory of Automated Timetabling IV","year":"2003","unstructured":"Burke, E.K., De Causmaecker, P. (eds.): PATAT 2002. LNCS, vol.\u00a02740. Springer, Heidelberg (2003)"},{"key":"8_CR16","unstructured":"Duong, T.A., Lam, K.H.: Combining constraint programming and simulated annealing on university exam timetabling. In: RIVF2004. Proceedings of the 2nd International Conference in Computer Sciences, Research, Innovation & Vision for the Future, pp. 205\u2013210 (2004)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75514-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:25:23Z","timestamp":1558261523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755135","9783540755142"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}