{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:47:16Z","timestamp":1725533236085},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024771"},{"type":"electronic","value":"9783642024788"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02478-8_90","type":"book-chapter","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T18:46:41Z","timestamp":1244227601000},"page":"720-727","source":"Crossref","is-referenced-by-count":4,"title":["Evolutionary Genetic Algorithms in a Constraint Satisfaction Problem: Puzzle Eternity II"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Mu\u00f1oz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"German","family":"Gutierrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Araceli","family":"Sanchis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"90_CR1","unstructured":"Tomy: Eternity II (official site) (November 2008), \n                    \n                      http:\/\/www.eternityii.com"},{"key":"90_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"E. Demaine","year":"2007","unstructured":"Demaine, E., Demaine, M.: Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity. Graphs and Combinatorics\u00a023, 195\u2013208 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"90_CR3","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"issue":"1","key":"90_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00223-8","volume":"65","author":"V. Raman","year":"1998","unstructured":"Raman, V., Ravikumar, B., Rao, S.: A simplified NP-complete MAXSAT problem. Information Processing Letters\u00a065(1), 1\u20136 (1998)","journal-title":"Information Processing Letters"},{"key":"90_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1007\/BFb0056920","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"S. Rana","year":"1998","unstructured":"Rana, S., Whitley, D.: Genetic algorithm behavior in the MAXSAT domain. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 785\u2013794. Springer, Heidelberg (1998)"},{"issue":"1","key":"90_CR6","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for Constraint-Satisfaction Problems: A Survey. AI Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"AI Magazine"},{"key":"90_CR7","unstructured":"Pierre Schaus, Y.D.: Hybridization of CP and VLNS for Eternity II. JFPC (2008)"},{"issue":"1","key":"90_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J. Gottlieb","year":"2002","unstructured":"Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary Algorithms for the Satisfiability Problem. Evolutionary Computation\u00a010(1), 35\u201350 (2002)","journal-title":"Evolutionary Computation"},{"key":"90_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BFb0040766","volume-title":"Evolutionary Programming VII","author":"T. B\u00e4ck","year":"1998","unstructured":"B\u00e4ck, T., Eiben, A., Vink, M.: A Superior Evolutionary Algorithm for 3-SAT. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol.\u00a01447, pp. 125\u2013136. Springer, Heidelberg (1998)"},{"key":"90_CR10","unstructured":"Eiben, A., van der Hauw, J.: Solving 3-SAT with adaptive Genetic Algorithms. In: Proceedings of the 4th IEEE Conference on Evolutionary Computation, pp. 81\u201386 (1997)"},{"key":"90_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/BFb0056917","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"J. Gottlieb","year":"1998","unstructured":"Gottlieb, J., Voss, N.: Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 755\u2013764. Springer, Heidelberg (1998)"},{"key":"90_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/3-540-45356-3_61","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"J. Gottlieb","year":"2000","unstructured":"Gottlieb, J., Voss: Adaptive fitness functions for the satisfiability problem. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol.\u00a01917, pp. 621\u2013630. Springer, Heidelberg (2000)"},{"key":"90_CR13","unstructured":"Marchiori, E., Rossi, C.: A flipping genetic algorithm for hard 3-SAT problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol.\u00a01, pp. 459\u2013465 (1999)"},{"key":"90_CR14","doi-asserted-by":"crossref","unstructured":"Rossi, C., Marchiori, E., Kok, J.: An adaptive evolutionary algorithm for the satisfiability problem. In: Proceedings of the 2000 ACM symposium on Applied computing, vol.\u00a01, pp. 463\u2013469 (2000)","DOI":"10.1145\/335603.335912"},{"issue":"3","key":"90_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence\u00a014(3), 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"issue":"5","key":"90_CR16","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TEVC.2003.816584","volume":"7","author":"B. Craenen","year":"2003","unstructured":"Craenen, B., Eiben, A., van Hemert, J.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation\u00a07(5), 424\u2013444 (2003)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"90_CR17","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Systems: Computational and Ambient Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02478-8_90","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T06:23:01Z","timestamp":1538806981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02478-8_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024771","9783642024788"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02478-8_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}