{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:30:00Z","timestamp":1770964200601,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,29]],"date-time":"2011-03-29T00:00:00Z","timestamp":1301356800000},"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-011-0866-7","type":"journal-article","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:15:47Z","timestamp":1301303747000},"page":"413-425","source":"Crossref","is-referenced-by-count":9,"title":["An effective greedy heuristic 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":[[2011,3,29]]},"reference":[{"key":"866_CR1","unstructured":"Aguado, A. (2004). A 10 days solution to the social golfer problem. Manuscript."},{"issue":"1","key":"866_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":"866_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":"866_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/(SICI)1520-6610(1999)7:5<375::AID-JCD6>3.0.CO;2-K","volume":"7","author":"C. J. Colbourn","year":"1999","unstructured":"Colbourn, C. J. (1999). A Steiner 2-design with an automorphism fixing exactly r+2 points. Journal of Combinatorial Designs, 7, 375\u2013380.","journal-title":"Journal of Combinatorial Designs"},{"key":"866_CR5","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":"866_CR6","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.\u00a0150\u2013161)."},{"key":"866_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)."},{"key":"866_CR8","series-title":"LNCS","first-page":"93","volume-title":"CP\u201901, the 7th int. conf. on principles and practice of constraint programming","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In LNCS: Vol. 2239. CP\u201901, the 7th int. conf. on principles and practice of constraint programming (pp.\u00a093\u2013107)."},{"key":"866_CR9","volume-title":"IJCAI\u201905 workshop on modelling and solving problems with constraints","author":"I. Gent","year":"2005","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":"866_CR10","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."},{"key":"866_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jcd.3180030404","volume":"4","author":"D. Gordon","year":"1995","unstructured":"Gordon, D., Kuperberg, G., & Patashnik, O. (1995). New constructions for covering designs. Journal of Combinatorial Designs, 4, 269\u2013284.","journal-title":"Journal of Combinatorial Designs"},{"key":"866_CR12","unstructured":"Harvey, W. (2002). Warwick\u2019s results page for the social golfer problem. http:\/\/www.icparc.ic.ac.uk\/~wh\/golf\/ ."},{"key":"866_CR13","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.\u00a0286\u2013300)."},{"issue":"4","key":"866_CR14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1147\/rd.144.0390","volume":"14","author":"M. Y. Hsiao","year":"1970","unstructured":"Hsiao, M. Y., Bossen, D. C., & Chien, R. T. (1970). Orthogonal Latin square codes. IBM Journal of Research and Development, 14(4), 390\u2013394.","journal-title":"IBM Journal of Research and Development"},{"key":"866_CR15","unstructured":"McKay, B. (1990). Nauty user\u2019s guide (version\u00a01.5) (Technical report). Dept. Comp. Sci., Australian National University."},{"key":"866_CR16","volume-title":"European starting AI researcher symp","author":"K. E. Petrie","year":"2004","unstructured":"Petrie, K. E., Smith, B., & Yorke-Smith, N. (2004). Dynamic symmetry breaking in constraint programming and linear programming hybrids. In European starting AI researcher symp."},{"key":"866_CR17","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D. R. Stinson","year":"1994","unstructured":"Stinson, D. R. (1994). Universal hashing and authentication codes. Designs, Codes and Cryptography, 4, 369\u2013380.","journal-title":"Designs, Codes and Cryptography"},{"key":"866_CR18","author":"M. Triska","year":"2010","unstructured":"Triska, M., & Musliu, N. (2010). An improved SAT formulation for the social golfer problem. Annals of Operations Research. 10.1007\/s10479-010-0702-5 .","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-011-0866-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0866-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0866-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:05Z","timestamp":1559138885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0866-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,29]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["866"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0866-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,29]]}}}