{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:09:31Z","timestamp":1743023371654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030557881"},{"type":"electronic","value":"9783030557898"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-55789-8_19","type":"book-chapter","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T23:07:57Z","timestamp":1599174477000},"page":"210-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable Transformation to a $$2\\times 2$$ Domain Space for Edge Matching Puzzles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6968-1989","authenticated-orcid":false,"given":"Thomas","family":"Aspinall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1666-5501","authenticated-orcid":false,"given":"Adrian","family":"Gepp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4284-8619","authenticated-orcid":false,"given":"Geoff","family":"Harris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3977-2468","authenticated-orcid":false,"given":"Bruce James","family":"Vanstone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,4]]},"reference":[{"key":"19_CR1","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 Combinator. 23, 195\u2013208 (2007). https:\/\/doi.org\/10.1007\/s00373-007-0713-4","journal-title":"Graphs Combinator."},{"key":"19_CR2","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J., Manya, F.: Measuring the hardness of sat instances. In: Twenty-Third AAAI Conference on Artificial Intelligence, pp. 222\u2013228 (2008)"},{"key":"19_CR3","unstructured":"Selby, A., Riordan, O.: Eternity - description of method (2000). http:\/\/www.archduke.org\/eternity\/method\/desc.html"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-319-92058-0_60","volume-title":"Recent Trends and Future Technology in Applied Intelligence","author":"G Harris","year":"2018","unstructured":"Harris, G., Vanstone, B.J., Gepp, A.: Automatically generating and solving Eternity II style puzzles. In: Mouhoub, M., Sadaoui, S., Ait Mohamed, O., Ali, M. (eds.) IEA\/AIE 2018. LNCS (LNAI), vol. 10868, pp. 626\u2013632. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92058-0_60"},{"key":"19_CR5","series-title":"Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman, New York (1979)"},{"key":"19_CR6","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.M. (eds.) IWANN 2009. LNCS, vol. 5517, pp. 720\u2013727. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02478-8_90"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10601-012-9128-9","volume":"18","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e1ndez, C., Mateu, C.: On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints 18, 7\u201337 (2013). https:\/\/doi.org\/10.1007\/s10601-012-9128-9","journal-title":"Constraints"},{"key":"19_CR8","unstructured":"Heule, M.J.H.: Solving edge-matching problems with satisfiability solvers. In: Kullmann, O. (ed.) International Conference on Theory and Applications of Satisfiability Testing, pp. 69\u201382 (2009)"},{"key":"19_CR9","unstructured":"Schaus, P., Deville, Y.: Hybridization of CP and VLNS for eternity II. In: Journ\u00e9es Francophones de Programmation par Contraintes (JFPC 2008) (2008)"},{"key":"19_CR10","first-page":"036","volume":"3","author":"E Bourreau","year":"2008","unstructured":"Bourreau, E., Benoist, T.: Fast global filtering for Eternity II. Constraint Program. Lett. (CPL) 3, 036\u2013049 (2008)","journal-title":"Constraint Program. Lett. (CPL)"},{"key":"19_CR11","unstructured":"Meta 2010 problem instances (2010). http:\/\/web.ntnu.edu.tw\/~tcchiang\/publications\/META2010-Instances.rar"},{"key":"19_CR12","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), vol. 10 (2010)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10852-012-9178-4","volume":"11","author":"T Wauters","year":"2012","unstructured":"Wauters, T., Vancroonenburg, W., Berghe, G.V.: A guide-and-observe hyper-heuristic approach to the Eternity II puzzle. J. Math. Model. Algor. 11(3), 217\u2013233 (2012). https:\/\/doi.org\/10.1007\/s10852-012-9178-4","journal-title":"J. Math. Model. Algor."},{"key":"19_CR14","unstructured":"Salassa, F., Vancroonenburg, W., Wauters, T., Croce, F.D., Berghe, G.V.: MILP and max-clique based heuristics for the eternity II puzzle. CoRR abs\/1709.00252 (2017)"},{"issue":"9","key":"19_CR15","doi-asserted-by":"publisher","first-page":"3231","DOI":"10.1016\/j.jspi.2005.01.007","volume":"136","author":"M Liefvendahl","year":"2006","unstructured":"Liefvendahl, M., Stocki, R.: A study on algorithms for optimization of Latin hypercubes. J. Stat. Plan. Infer. 136(9), 3231\u20133247 (2006)","journal-title":"J. Stat. Plan. Infer."},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V.D., Nguyen, A., Artigues, C.: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem. Eur. J. Oper. Res. 191(3), 912\u2013927 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1052796.1052804","volume":"36","author":"S Aaronson","year":"2005","unstructured":"Aaronson, S.: Guest column: NP-complete problems and physical reality. ACM SIGACT News 36(1), 30\u201352 (2005)","journal-title":"ACM SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55789-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T10:12:02Z","timestamp":1608027122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-55789-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030557881","9783030557898"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55789-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IEA\/AIE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ieaaie2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jsasaki3.wixsite.com\/ieaaie2020\/organizations","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,35","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}