{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:54Z","timestamp":1725559254790},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261520"},{"type":"electronic","value":"9783540322641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493853_13","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T07:35:25Z","timestamp":1279092925000},"page":"155-167","source":"Crossref","is-referenced-by-count":11,"title":["Scheduling Social Golfers Locally"],"prefix":"10.1007","author":[{"given":"Iv\u00e1n","family":"Dot\u00fa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"\u00c5gren, M.: Solving the Social Golfer Using Local Search (2003), \n                    \n                      http:\/\/peg.it.uu.se\/~saps02\/MagnusAgren\/"},{"key":"#cr-split#-13_CR2.1","doi-asserted-by":"crossref","unstructured":"Barnier, N., Brisset, P.: Solving kirkman???s schoolgirl problem in a few seconds. Constraints (2005);","DOI":"10.1007\/s10601-004-5305-9"},{"key":"#cr-split#-13_CR2.2","unstructured":"Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.??2470, p. 477. Springer, Heidelberg (2002)"},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/9781420049954","volume-title":"The CRC Handbook of Combinatorial Design","author":"C. Colbourn","year":"1996","unstructured":"Colbourn, C., Dinitz, J.H.: The CRC Handbook of Combinatorial Design. CRC Press, Boca Raton (1996)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0378-3758(00)00276-7","volume":"95","author":"C.J. Colbourn","year":"2001","unstructured":"Colbourn, C.J., Dinitz, J.H.: Mutually orthogonal latin squares: A brief survey of constructions. Journal of Statistical Planning and Inference\u00a095, 9\u201348 (2001)","journal-title":"Journal of Statistical Planning and Inference"},{"key":"13_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":"13_CR6","unstructured":"Prestwich, S.: Randomized backtracing for linear pseudo-boolean constraint problems. In: Proceedings 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 2002, pp. 7\u201319 (2002)"},{"key":"13_CR7","unstructured":"Prestwich, S.D.: Supersymmetric Modeling for Local Search. In: Second International Workshop on Symmetry in Constraint Satisfaction Problems (2002)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021809724362","volume":"118","author":"S.D. Prestwich","year":"2003","unstructured":"Prestwich, S.D.: Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research\u00a0118, 137\u2013150 (2003)","journal-title":"Annals of Operations Research"},{"key":"#cr-split#-13_CR9.1","doi-asserted-by":"crossref","unstructured":"Puget, J.F.: Symmetry breaking revisited. Constraints (2005);","DOI":"10.1007\/s10601-004-5306-8"},{"key":"#cr-split#-13_CR9.2","unstructured":"Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.??2470, p. 446. Springer, Heidelberg (2002)"},{"key":"13_CR10","unstructured":"Sellmann, M.: Reduction Techniques in Constraint Programming and Combinatorial Optimization. PhD thesis, University of Paderborn, Germany (2003)"},{"key":"13_CR11","unstructured":"Sellmann, M., Harvey, W.: Heuristic constraint propagation \u2013 Using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem. In: Jussien, N., Laburthe, F. (eds.) Proceedings 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 2002, pp. 191\u2013204 (2002)"},{"key":"13_CR12","unstructured":"Smith, B.: Reducing Symmetry in a Combinatorial Design Problem. In: CP-AI-OR 2001, Wye College (Imperial College), Ashford, Kent UK, April 2001, pp. 351\u2013359 (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11493853_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T18:04:52Z","timestamp":1552759492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493853_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261520","9783540322641"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11493853_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}