{"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":1771872655473,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10479-010-0702-5","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T00:45:48Z","timestamp":1265244348000},"page":"427-438","source":"Crossref","is-referenced-by-count":16,"title":["An improved SAT formulation for the social golfer problem"],"prefix":"10.1007","volume":"194","author":[{"given":"Markus","family":"Triska","sequence":"first","affiliation":[]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"702_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198500292.001.0001","volume-title":"Combinatorial designs and tournaments","author":"I. Anderson","year":"1997","unstructured":"Anderson, I. (1997). Combinatorial designs and tournaments. Oxford: Clarendon."},{"issue":"1","key":"702_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10601-004-5305-9","volume":"10","author":"N. Barnier","year":"2005","unstructured":"Barnier, N., & Brisset, P. (2005). Solving Kirkman\u2019s schoolgirl problem in a few seconds. Constraints, 10(1), 7\u201321.","journal-title":"Constraints"},{"key":"702_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(84)90075-1","volume":"8","author":"C. J. Colbourn","year":"1984","unstructured":"Colbourn, C. J. (1984). The complexity of completing partial Latin squares. Discrete Applied Mathematics, 8, 25\u201330.","journal-title":"Discrete Applied Mathematics"},{"key":"702_CR4","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","volume-title":"The CRC handbook of combinatorial designs","author":"C. H. Colbourn","year":"1996","unstructured":"Colbourn, C. H., & Dinitz, J. H. (1996). The CRC handbook of combinatorial designs. Boca Raton: CRC Press."},{"key":"702_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/11890584_12","volume-title":"Hybrid metaheuristics","author":"C. Cotta","year":"2006","unstructured":"Cotta, C., Dot\u00fa, I., Fern\u00e1ndez, A. J., & Hentenryck, P. V. (2006). Scheduling social golfers with memetic evolutionary programming. In LNCS : Vol. 4030. Hybrid metaheuristics (pp. 150\u2013161). Berlin: Springer."},{"key":"702_CR6","unstructured":"Crawford, J. M., Ginsberg, M. L., Luks, E. M., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In KR (pp.\u00a0148\u2013159)."},{"key":"702_CR7","series-title":"LNCS","first-page":"155","volume-title":"CPAIOR","author":"I. Dot\u00fa","year":"2005","unstructured":"Dot\u00fa, I., & Hentenryck, P. V. (2005). Scheduling social golfers locally. In LNCS : Vol. 3524. CPAIOR (pp.\u00a0155\u2013167). Berlin: Springer."},{"key":"702_CR8","series-title":"LNCS","volume-title":"CP\u201902","author":"P. Flener","year":"2002","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 LNCS : Vol. 2470. CP\u201902. Berlin: Springer."},{"key":"702_CR9","series-title":"LNCS","volume-title":"CP\u201902","author":"A. Frisch","year":"2002","unstructured":"Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., & Walsh, T. (2002). Global constraints for lexicographic orderings. In LNCS : Vol. 2470. CP\u201902. Berlin: Springer."},{"key":"702_CR10","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":"702_CR11","series-title":"LNCS","volume-title":"CP\u201999","author":"I. P. Gent","year":"1999","unstructured":"Gent, I. P., & Walsh, T. (1999). CSPLib: a benchmark library for constraints. In LNCS : Vol. 1713. CP\u201999. Berlin: Springer."},{"key":"702_CR12","series-title":"LNCS","first-page":"286","volume-title":"CP\u201905","author":"W. Harvey","year":"2005","unstructured":"Harvey, W., & Winterer, T. (2005). Solving the MOLR and social golfers problems. In LNCS : Vol. 3709. CP\u201905 (pp. 286\u2013300). Berlin: Springer."},{"key":"702_CR13","unstructured":"Petrie, K. E., & Smith, B. (2004). Dynamic symmetry breaking in constraint programming and linear programming (Technical report)."},{"key":"702_CR14","unstructured":"Prestwich, S. (2001). First-solution search with symmetry breaking and implied constraints. In Proceedings of the CP\u201901 workshop on modelling and problem formulation."},{"key":"702_CR15","unstructured":"Selman, B., Kautz, H., & Cohen, B. (1993). Local search strategies for satisfiability testing. In Second DIMACS implementation challenge."},{"key":"702_CR16","series-title":"LNAI","volume-title":"CADE","author":"H. Zhang","year":"1997","unstructured":"Zhang, H. (1997). SATO: an efficient propositional prover. In LNAI : Vol. 1249. CADE. Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0702-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0702-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0702-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T13:46:55Z","timestamp":1711201615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0702-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["702"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0702-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}