{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T10:40:00Z","timestamp":1729593600971,"version":"3.28.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10852-013-9222-z","type":"journal-article","created":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T12:54:53Z","timestamp":1686833693000},"page":"27-43","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle"],"prefix":"10.1007","volume":"12","author":[{"given":"Tony","family":"Wauters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Vancroonenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greet Vanden","family":"Berghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,1]]},"reference":[{"key":"9222_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e0ndez, C., Mateu, C.: Edge matching puzzles as hard sat\/csp benchmarks. In: CP \u201908 Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (2008)","DOI":"10.1007\/978-3-540-85958-1_42"},{"key":"9222_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-11266-9_13","volume-title":"Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM \u201910","author":"A Antoniadis","year":"2010","unstructured":"Antoniadis, A., Lingas, A.: Approximability of edge matching puzzles. In: Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM \u201910, pp. 153\u2013164. Springer, Berlin, Heidelberg (2010)"},{"key":"9222_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, chapter\u00a016","author":"E Burke","year":"2003","unstructured":"Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, chapter\u00a016, pp. 457\u2013474. Springer, New York (2003)"},{"key":"9222_CR4","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristics approaches. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, 2nd ed. International Series in Operations Research & Management Science, vol.\u00a057, chapter\u00a015, pp. 449\u2013468. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"9222_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9, 451\u2013470 (2003)","journal-title":"Journal of Heuristics"},{"key":"9222_CR6","unstructured":"Coelho, I., Coelho, B., Coelho, V., Haddad, M., Souza, M., Ochi, L.: A general variable neighborhood search approach for the resolution of the eternity ii puzzle. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, META\u201910 (2010)"},{"issue":"1","key":"9222_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Comb. 23(1), 195\u2013208 (2007)","journal-title":"Graphs Comb."},{"key":"9222_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimisation heuristics. the great deluge algorithm and record-to-record travel. J. Comput. Phys. 104, 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"key":"9222_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Norwell, MA (1997)"},{"key":"9222_CR10","unstructured":"Heule, M.J.H.: Solving edge-matching problems with satisfiability solvers. In: Proceedings of the Second International Workshop on Logic and Search (LaSh 2008) (2008)"},{"issue":"4598","key":"9222_CR11","first-page":"671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science, New Series 220(4598), 671\u2013680 (1983)","journal-title":"Science, New Series"},{"key":"9222_CR12","unstructured":"Misir, M., Wauters, T., Verbeeck, K., Vanden Berghe, G.: A new learning hyper-heuristic for the traveling tournament problem. In: Proceedings Of The VIII Metaheuristics International Conference (2009)"},{"key":"9222_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-642-02478-8_90","volume-title":"Bio-Inspired Systems: Computational and Ambient Intelligence","author":"J Mu\u00f1oz","year":"2009","unstructured":"Mu\u00f1oz, J., Gutierrez, G., Sanchis, A.: Evolutionary genetic algorithms in a constraint satisfaction problem: Puzzle eternity ii. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J. (eds.) Bio-Inspired Systems: Computational and Ambient Intelligence. Lecture Notes in Computer Science, vol. 5517, pp. 720\u2013727. Springer, Berlin, Heidelberg (2009)"},{"key":"9222_CR14","first-page":"39","volume":"1","author":"E Ozcan","year":"2010","unstructured":"Ozcan, E., Misir, M., Ochoa, G., Burke, E.K.: A reinforcement learning\u2014great-deluge hyper-heuristic for examination timetabling. IJAMC 1, 39\u201359 (2010)","journal-title":"IJAMC"},{"key":"9222_CR15","unstructured":"Schaus, P., Deville, Y.: Hybridization of cp and vlns for eternity ii. In: JFPC\u201908 Quatri\u00e8me Journ\u00e9es Francophones de Programmation par Contraintes (2008)"},{"key":"9222_CR16","doi-asserted-by":"crossref","unstructured":"Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley (2009)","DOI":"10.1002\/9780470496916"},{"key":"9222_CR17","unstructured":"Vancroonenburg, W., Wauters, T., Vanden Berghe, G.: A two phase hyper-heuristic approach for solving the eternity ii puzzle. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, META\u201910 (2010)"},{"key":"9222_CR18","unstructured":"Wang, W.-S., Chiang, T.-C.: Solving eternity-ii puzzles with a tabu search algorithm. In: Proceedings of the 3rd International Conference on Metaheuristics and Nature Inspired Computing, META\u201910 (2010)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-013-9222-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10852-013-9222-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-013-9222-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T10:01:16Z","timestamp":1729591276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10852-013-9222-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9222"],"URL":"https:\/\/doi.org\/10.1007\/s10852-013-9222-z","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"type":"print","value":"1570-1166"},{"type":"electronic","value":"1572-9214"}],"subject":[],"published":{"date-parts":[[2013,3]]},"assertion":[{"value":"28 February 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2011","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}