{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T08:23:02Z","timestamp":1778833382172,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540218364","type":"print"},{"value":"9783540246640","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_19","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"271-286","source":"Crossref","is-referenced-by-count":6,"title":["Models and Symmetry Breaking for \u2018Peaceable Armies of Queens\u2019"],"prefix":"10.1007","author":[{"given":"Barbara M.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karen E.","family":"Petrie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian P.","family":"Gent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"6","volume":"62","author":"R.A. Bosch","year":"1999","unstructured":"Bosch, R.A.: Peaceably Coexisting Armies of Queens. Optima (Newsletter of the Mathematical Programming Society)\u00a062, 6\u20139 (1999)","journal-title":"Optima (Newsletter of the Mathematical Programming Society)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1009894810205","volume":"4","author":"B.M.W. Cheng","year":"1999","unstructured":"Cheng, B.M.W., Choi, K.M.F., Lee, J.H.M., Wu, J.C.K.: Increasing constraint propagation by redundant modeling: an experience report. Constraints\u00a04, 167\u2013192 (1999)","journal-title":"Constraints"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Chess Queens and Maximum Unattacked Cells. Math Horizon, pp. 12\u201316 (November 1999)","DOI":"10.1080\/10724117.1999.12088462"},{"key":"19_CR4","unstructured":"Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Horn, W. (ed.) Proceedings ECAI 2000, pp. 599\u2013603 (2000)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/3-540-45578-7_50","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"B.M. Smith","year":"2001","unstructured":"Smith, B.M.: Dual Models of Permutation Problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 615\u2013619. Springer, Heidelberg (2001)"},{"key":"19_CR6","unstructured":"Velucchi, M.: For me, this is the best chess-puzzle: Non-dominating queens problem, http:\/\/anduin.eldar.org\/~problemi\/papers.html (Accessed January 2004)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T07:28:59Z","timestamp":1592033339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}