{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:28:01Z","timestamp":1769023681939,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0377-2217(03)00101-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"92-101","source":"Crossref","is-referenced-by-count":50,"title":["Global constraints for round robin tournament scheduling"],"prefix":"10.1016","volume":"153","author":[{"given":"Martin","family":"Henz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Thiel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00101-2_BIB1","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB2","series-title":"Combinatorial Designs and Tournaments","author":"Anderson","year":"1997"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB3","series-title":"Optimal Strategies in Sports, number 5 in Studies in Management Science and Systems","first-page":"32","article-title":"The computer-assisted heuristic approach used to schedule the major league baseball clubs","author":"Cain","year":"1977"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB4","series-title":"Studies on Graphs and Discrete Programming","first-page":"381","article-title":"Scheduling in sports","author":"de Werra","year":"1980"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0, 1-vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"23","author":"Edmonds","year":"1965","journal-title":"Canadian Journal on Mathematics"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB7","series-title":"Proceedings of the International Conference on Logic Programming, Las Cruces, New Mexico","first-page":"545","article-title":"Constraint-based round robin tournament planning","author":"Henz","year":"1999"},{"issue":"1","key":"10.1016\/S0377-2217(03)00101-2_BIB8","doi-asserted-by":"crossref","DOI":"10.1287\/opre.49.1.163.11193","article-title":"Scheduling a major college basketball conference\u2013\u2013revisited","volume":"49","author":"Henz","year":"2001","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB9","unstructured":"M. Henz, T. M\u00fcller, S. Thiel, M. van Brandenburg, Benchmarks and results for round robin tournaments, http:\/\/www.comp.nus.edu.sg\/~henz\/roundrobin_benchmarks, 2000"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB10","unstructured":"ILOG Inc., Mountain View, CA 94043, USA, http:\/\/www.ilog.com, ILOG Solver 4.0, Reference Manual, 1997"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB11","unstructured":"K. McAloon, C. Tretkoff, G. Wetzel, Sports league scheduling, in: Proceedings of the 1997 ILOG Optimization Suite International Users\u2019 Conference, Paris, July 1997"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB12","series-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"Mehlhorn","year":"1999"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB13","unstructured":"Mozart Consortium, The Mozart Programming System. Documentation and system available from http:\/\/www.mozart-oz.org, Programming Systems Lab, Saarbr\u00fccken, Swedish Institute of Computer Science, Stockholm, and Universit\u00e9 Catholique de Louvain, 1999"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB14","unstructured":"T. M\u00fcller, Constraint extensions tutorial, http:\/\/www.mozart-oz.org, Programming Systems Lab, Saarbr\u00fccken, Swedish Institute of Computer Science, Stockholm, and Universit\u00e9 Catholique de Louvain, 1999"},{"issue":"1","key":"10.1016\/S0377-2217(03)00101-2_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.46.1.1","article-title":"Scheduling a major college basketball conference","volume":"46","author":"Nemhauser","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB16","series-title":"Proceedings of the AAAI 12th National Conference on Artificial Intelligence","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","author":"R\u00e9gin","year":"1994"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB17","first-page":"420","article-title":"The symmetric alldiff constraint","volume":"vol. 1","author":"R\u00e9gin","year":"1999"},{"issue":"1","key":"10.1016\/S0377-2217(03)00101-2_BIB18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1093\/biomet\/67.1.127","article-title":"Balancing carry-over effects in round robin tournaments","volume":"67","author":"Russell","year":"1980","journal-title":"Biometrika"},{"issue":"1","key":"10.1016\/S0377-2217(03)00101-2_BIB19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1009845710839","article-title":"Scheduling sport tournaments using constraint logic programming","volume":"4","author":"Schaerf","year":"1999","journal-title":"Constraints"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB20","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0166-218X(92)90252-6","article-title":"Combinatorial aspects of construction of competition Dutch professional football leagues","volume":"35","author":"Schreuder","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB21","series-title":"Computer Science Today, Lecture Notes in Computer Science 1000","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0015252","article-title":"The Oz programming model","author":"Smolka","year":"1995"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB22","series-title":"Practice and Theory of Automated Timetabling III, Selected Papers of PATAT 2000, Konstanz, Germany, Lecture Notes in Computer Science 2079","article-title":"A schedule-then-break approach to sports timetabling","author":"Trick","year":"2000"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB23","series-title":"One-Factorizations","author":"Wallis","year":"1997"},{"key":"10.1016\/S0377-2217(03)00101-2_BIB24","unstructured":"J.P. Walser, Domain-Independent Local Search for Linear Integer Optimization, PhD thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, August 1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703001012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703001012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:23:58Z","timestamp":1553228638000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703001012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0377221703001012"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00101-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}