{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T18:50:55Z","timestamp":1771872655996,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,9]],"date-time":"2015-06-09T00:00:00Z","timestamp":1433808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10479-015-1914-5","type":"journal-article","created":{"date-parts":[[2015,6,8]],"date-time":"2015-06-08T05:48:46Z","timestamp":1433742526000},"page":"423-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Set constraint model and automated encoding into SAT: application to the social golfer problem"],"prefix":"10.1007","volume":"235","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"1914_CR1","unstructured":"Azevedo, F. (2006). An attempt to dynamically break symmetries in the social golfers problem. In F. Azevedo, P. Barahona, F. Fages, & F. Rossi (Eds.), CSCLP, Lecture Notes in Computer Science, vol. 4651 (pp. 33\u201347). Springer."},{"key":"1914_CR2","doi-asserted-by":"crossref","unstructured":"Bacchus, F. (2007). Gac via unit propagation. In Proceedings of CP 2007, LNCS, vol. 4741 (pp. 133\u2013147). Springer.","DOI":"10.1007\/978-3-540-74970-7_12"},{"key":"1914_CR3","doi-asserted-by":"crossref","unstructured":"Bailleux, O., & Boufkhad, Y. (2003). Efficient cnf encoding of boolean cardinality constraints. In Proceedings of CP 2003, vol. 2833 (pp. 108\u2013122). Springer.","DOI":"10.1007\/978-3-540-45193-8_8"},{"key":"1914_CR4","doi-asserted-by":"crossref","unstructured":"Balint, A., & Fr\u00f6hlich, A. (2010). Improving stochastic local search for SAT with a new probability distribution. In Proceedings of Theory and Applications of Satisfiability Testing\u2014SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11\u201314, 2010 (pp. 10\u201315).","DOI":"10.1007\/978-3-642-14186-7_3"},{"key":"1914_CR5","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., Hebrard, E., & Walsh, T. (2004). Local consistencies in sat. In Selected Revised Papers of SAT 2003, LNCS, vol. 2919 (pp. 299\u2013314). Springer.","DOI":"10.1007\/978-3-540-24605-3_23"},{"key":"1914_CR6","unstructured":"Choco. http:\/\/www.emn.fr\/z-info\/choco-solver\/ ."},{"key":"1914_CR7","doi-asserted-by":"crossref","unstructured":"Cotta, C., Dot\u00fa, I., Fern\u00e1ndez, A. J., & Hentenryck, P. V. (2006). Scheduling social golfers with memetic evolutionary programming. In Proceedings of HM 2006, LNCS, vol. 4030 (pp. 150\u2013161). Springer.","DOI":"10.1007\/11890584_12"},{"key":"1914_CR8","unstructured":"Crawford, J. M., Ginsberg, M. L., Luks, E. M., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In Proc. of KR\u201996 (pp. 148\u2013159). Morgan Kaufmann."},{"key":"1914_CR9","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., & Biere, A. (2005). Effective preprocessing in sat through variable and clause elimination. In Proceedings of SAT 2005, vol. 3569 (pp. 61\u201375).","DOI":"10.1007\/11499107_5"},{"key":"1914_CR10","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2003) An extensible sat-solver. In Proceedings of SAT 2003, vol. 2919 (pp. 502\u2013518).","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"1914_CR11","doi-asserted-by":"crossref","unstructured":"Flener, P., Frisch, A. M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., & Walsh, T. (2002). Breaking row and column symmetries in matrix models. In Proceedings of CP 2002, vol. 2470 (pp. 462\u2013476). Springer.","DOI":"10.1007\/3-540-46135-3_31"},{"key":"1914_CR12","doi-asserted-by":"crossref","unstructured":"Frisch, A. M., Hnich, B., Kiziltan, Z., Miguel, I., & Walsh, T. (2002). Global constraints for lexicographic orderings. In Proceedings of CP 2002, vol. 2470 (pp. 93\u2013108). Springer.","DOI":"10.1007\/3-540-46135-3_7"},{"key":"1914_CR13","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. (1979). Computers and intractability, a guide to the theory of NP-completeness. San Francisco: W.H. Freeman & Company."},{"key":"1914_CR14","unstructured":"Gent, I., & Lynce, I. (2005). A sat encoding for the social golfer problem. In IJCAI\u201905 workshop on modelling and solving problems with constraints."},{"key":"1914_CR15","unstructured":"Gent, I. P., & Prosser, P. (2002). An empirical study of the stable marriage problem with ties and incomplete lists. In Proceedings of ECAI\u20192002 (pp. 141\u2013145). IOS Press."},{"key":"1914_CR16","doi-asserted-by":"crossref","unstructured":"Gent, I. P., & Walsh, T. (1999). CSPLib: A benchmark library for constraints. In Proceedings of CP 1999, LNCS, vol. 1713 (pp. 480\u2013481). Springer.","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"1914_CR17","unstructured":"Gervet, C. (1994). Conjunto: Constraint propagation over set constraints with finite set domain variables. In Proceedings of ICLP\u201994 (p. 733). MIT Press."},{"key":"1914_CR18","doi-asserted-by":"crossref","unstructured":"Lardeux, F., Monfroy, E., Saubion, F., Crawford, B., & Castro, C. (2009). Sat encoding and csp reduction for interconnected alldiff constraints. In Proceedings of MICAI 2009 (pp. 360\u2013371).","DOI":"10.1007\/978-3-642-05258-3_32"},{"key":"1914_CR19","doi-asserted-by":"crossref","unstructured":"Legeard, B., & Legros, E. (1991). Short overview of the clps system. In Proceedings of PLILP\u201991, vol. 528 (pp. 431\u2013433). Springer.","DOI":"10.1007\/3-540-54444-5_123"},{"key":"1914_CR20","unstructured":"MiniZinc. http:\/\/www.minizinc.org\/ ."},{"issue":"1\u20134","key":"1914_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1021809724362","volume":"118","author":"SD Prestwich","year":"2003","unstructured":"Prestwich, S. D. (2003). Negative effects of modeling techniques on search performance. Annals OR, 118(1\u20134), 137\u2013150.","journal-title":"Annals OR"},{"key":"1914_CR22","volume-title":"Handbook of constraint programming","year":"2006","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of constraint programming. Amsterdam: Elsevier."},{"issue":"1","key":"1914_CR23","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10479-010-0702-5","volume":"194","author":"M Triska","year":"2012","unstructured":"Triska, M., & Musliu, N. (2012). An improved sat formulation for the social golfer problem. Annals of Operations Research, 194(1), 427\u2013438.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1914-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1914-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1914-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T10:10:54Z","timestamp":1566814254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1914-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["1914"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1914-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,9]]}}}