{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T18:50:56Z","timestamp":1771872656002,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540292388","type":"print"},{"value":"9783540320500","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_23","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:31:28Z","timestamp":1129627888000},"page":"286-300","source":"Crossref","is-referenced-by-count":12,"title":["Solving the MOLR and Social Golfers Problems"],"prefix":"10.1007","author":[{"given":"Warwick","family":"Harvey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Winterer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-46135-3_32","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N. Barnier","year":"2002","unstructured":"Barnier, N., Brisset, P.: Solving the Kirkman\u2019s Schoolgirl Problem in a few seconds. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 477\u2013491. Springer, Heidelberg (2002)"},{"key":"23_CR2","volume-title":"The CRC Handbook of Combinatorial Designs","year":"1996","unstructured":"Colbourn, C.H., Dinitz, J.H. (eds.): The CRC Handbook of Combinatorial Designs. CRC Press, Rockville (1996)"},{"issue":"3","key":"23_CR3","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1515\/joc.2003.24.3.94","volume":"24","author":"I.B. Djordjevic","year":"2003","unstructured":"Djordjevic, I.B., Vasic, B.: LDPC codes for long haul optical communications based on high-girth designs. Journal of Optical Communications\u00a024(3), 94\u201396 (2003)","journal-title":"Journal of Optical Communications"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/11493853_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"I. Dot\u00fa","year":"2005","unstructured":"Dot\u00fa, I., Van Hentenryck, P.: Scheduling social golfers locally. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 155\u2013167. Springer, Heidelberg (2005)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45578-7_7","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 93\u2013107. Springer, Heidelberg (2001)"},{"key":"23_CR6","first-page":"141","volume":"17","author":"M.F. Franklin","year":"1984","unstructured":"Franklin, M.F.: Triples of almost orthogonal 10 \u00d710 latin squares useful in experimental design. Ars Combinatoria\u00a017, 141\u2013146 (1984)","journal-title":"Ars Combinatoria"},{"key":"23_CR7","unstructured":"The GAP Group. GAP \u2013 Groups, Algorithms, and Programming, Version 4.3 (2002), http:\/\/www.gap-system.org"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-45193-8_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"I.P. Gent","year":"2003","unstructured":"Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: Generic SBDD using computational group theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 333\u2013347. Springer, Heidelberg (2003)"},{"key":"23_CR9","unstructured":"Gent, I.P., Walsh, T., Selman, B.: CSPLib: a problem library for constraints, http:\/\/csplib.org\/"},{"key":"23_CR10","unstructured":"Harvey, W.: Warwick\u2019s results page for the MOLR problem, http:\/\/www.icparc.ic.ac.uk\/~wh\/molr"},{"key":"23_CR11","unstructured":"Harvey, W.: Warwick\u2019s results page for the social golfer problem, http:\/\/www.icparc.ic.ac.uk\/~wh\/golf"},{"key":"23_CR12","unstructured":"Harvey, W.: Symmetry breaking and the social golfer problem. In: Flener, P., Pearson, J. (eds.) Proc. SymCon 2001: Symmetry in Constraints, pp. 9\u201316 (2001)"},{"key":"23_CR13","unstructured":"mathtalk-ga. Answer to Unique combinations of 4 numbers between 1 to N. Google Answers (2005), http:\/\/answers.google.com\/answers\/threadview?id=274891"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/S0377-2217(03)00247-9","volume":"157","author":"L. Michel","year":"2004","unstructured":"Michel, L., Van Hentenryck, P.: A simple tabu search for warehouse location. European Journal of Operations Research\u00a0157(3), 576\u2013591 (2004)","journal-title":"European Journal of Operations Research"},{"key":"23_CR15","first-page":"161","volume":"9","author":"G.L. Mullen","year":"1991","unstructured":"Mullen, G.L., Shiue, J.-S.: A simple construction for orthogonal latin rectangles. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a09, 161\u2013166 (1991)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"23_CR16","unstructured":"Prestwich, S.: Randomised backtracking for linear pseudo-boolean constraint problems. In: Jussien, N., Laburthe, F. (eds.) Proc. of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2002), Le Croisic, France, March, 25\u201327, pp. 7\u201319 (2002)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/3-540-46135-3_30","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"J.-F. Puget","year":"2002","unstructured":"Puget, J.-F.: Symmetry breaking revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 446\u2013461. Springer, Heidelberg (2002)"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1111\/j.1467-842X.1985.tb00575.x","volume":"27","author":"V.K. Sharma","year":"1985","unstructured":"Sharma, V.K., Das, M.N.: On resolvable incomplete block designs. Austral. J. Statist.\u00a027(3), 298\u2013302 (1985)","journal-title":"Austral. J. Statist."},{"key":"23_CR19","unstructured":"Smith, B.M.: Reducing symmetry in a combinatorial design problem. In: CPAIOR 2001: Proc. of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, April 2001, pp. 351\u2013359 (2001)"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A","volume":"8","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R., Zhu, L.: New constructions for perfect hash families and related structures using combinatorial designs and codes. Journal of Combinatorial Designs\u00a08(3), 189\u2013200 (2000)","journal-title":"Journal of Combinatorial Designs"},{"issue":"1","key":"23_CR21","first-page":"159","volume":"12","author":"M.G. Wallace","year":"1997","unstructured":"Wallace, M.G., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal\u00a012(1), 159\u2013200 (1997)","journal-title":"ICL Systems Journal"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1006\/eujc.2001.0518","volume":"22","author":"I.M. Wanless","year":"2001","unstructured":"Wanless, I.M.: Answers to questions by D\u00e9nes on latin power sets. Europ. J. Combinatorics\u00a022, 1009\u20131020 (2001)","journal-title":"Europ. J. Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:03:16Z","timestamp":1683244996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11564751_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}