{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:38:09Z","timestamp":1743118689486,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-78825-8_20","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"244-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Solving the Queen Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Michel","family":"Vasquez","sequence":"first","affiliation":[]},{"given":"Yannick","family":"Vimont","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"key":"20_CR1","unstructured":"Abramson, B., Yung, M.M.: Construction through decomposition: a divide-and-conquer algorithm for the N-queens problem. In: Proceedings of 1986 ACM Fall Joint Computer Conference. ACM 1986, pp. 620\u2013628, no. 9. IEEE Computer Society Press, Los Alamitos (1986). http:\/\/dl.acm.org\/citation.cfm?id=324493.324620."},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1016\/j.ejor.2007.01.063","volume":"189","author":"M Caramia","year":"2008","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Embedding a novel objective function in a two-phased local search for robust vertex coloring. Eur. J. Oper. Res. 189(3), 1358\u20131380 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.01.063. 9","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P Galinier","year":"2008","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the k-coloring problem. Discrete Appl. Math. 156(2), 267\u2013279 (2008). https:\/\/doi.org\/10.1016\/j.dam.2006.07.017. Computational Methods for Graph Coloring and it\u2019s Generalizations. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X07001114","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1287\/ijoc.1100.0436","volume":"24","author":"S Gualandi","year":"2012","unstructured":"Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS J. Comput. 24(1), 81\u2013100 (2012). https:\/\/doi.org\/10.1287\/ijoc.1100.0436","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.disopt.2008.10.004","volume":"6","author":"P Hansen","year":"2009","unstructured":"Hansen, P., Labb\u00e9, M., Schindl, D.: Set covering and packing formulations of graph coloring: algorithms and first polyhedral results. Discrete Optim. 6(2), 135\u2013147 (2009). https:\/\/doi.org\/10.1016\/j.disopt.2008.10.004. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1572528608000716","journal-title":"Discrete Optim."},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1023\/B:HEUR.0000034713.28244.e1","volume":"10","author":"M Vasquez","year":"2004","unstructured":"Vasquez, M.: New results on the queens_n2 graph coloring problem. J. Heuristics 10(4), 407\u2013413 (2004). https:\/\/doi.org\/10.1023\/B:HEUR.0000034713.28244.e1","journal-title":"J. Heuristics"},{"key":"20_CR7","unstructured":"Vasquez, M., Habet, D.: Complete and incomplete algorithms for the queen graph coloring problem. In: Proceedings of the 16th European Conference on Artificial Intelligence, ECAI 2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, 22\u201327 August, 2004, pp. 226\u2013230 (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:08:36Z","timestamp":1709809716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}