{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:07:20Z","timestamp":1769022440607,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1009845710839","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"43-65","source":"Crossref","is-referenced-by-count":34,"title":["Scheduling Sport Tournaments using Constraint Logic Programming"],"prefix":"10.1007","volume":"4","author":[{"given":"Andrea","family":"Schaerf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"199168_CR1","unstructured":"R. R. Bakker, F. Dikker, F. Tempelman, and P. M. Wognum. (1993). Diagnosing and solving over-determined constraints satisfaction problems. In Proc. of the 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), Morgan Kaufmann, pages 276\u2013281."},{"key":"199168_CR2","first-page":"32","volume-title":"Optimal Strategies in Sports","author":"W. O. Cain Jr.","year":"1977","unstructured":"W. O. Cain, Jr. (1977). The computer-assisted heuristic approach used to schedule the major league baseball clubs. In S. P. Ladany and R. E. Machol, editors, Optimal Strategies in Sports, North-Holland, Amsterdam, pages 32\u201341."},{"key":"199168_CR3","first-page":"15","volume-title":"Management Science in Sports","author":"R. T. Campbell","year":"1976","unstructured":"Robert Thomas Campbell and Der San Chen. (1976). A minimum distance basketball scheduling problem.In R. E. Machol, S. P. Ladany, and D. G. Morrison, editors, Management Science in Sports, North-Holland, Amsterdam, pages 15\u201325."},{"key":"199168_CR4","doi-asserted-by":"crossref","unstructured":"Charles J. Colbourn. (1983). Embedding partial Steiner triple systems is NP-complete. Journal of Combinatorial Theory, Series A 35:100\u2013105.","DOI":"10.1016\/0097-3165(83)90031-6"},{"issue":"3","key":"199168_CR5","first-page":"161","volume":"33","author":"D. Costa","year":"1995","unstructured":"D. Costa. (1995). An evolutionary tabu search algorithm and the NHL scheduling problem. INFOR, 33(3):161\u2013178.","journal-title":"INFOR"},{"key":"199168_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0166-218X(90)90019-9","volume":"26","author":"D. d. Werra","year":"1990","unstructured":"D. de Werra. L. Jacot-Descombes, and P. Masson. (1990).Aconstrained sports scheduling problem. Discrete Applied Mathematics, 26:41\u201349.","journal-title":"Discrete Applied Mathematics"},{"key":"199168_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","volume":"2","author":"D. d. Werra","year":"1980","unstructured":"D. de Werra. (1980). Geography, games and graphs. Discrete Applied Mathematics, 2:327\u2013337.","journal-title":"Discrete Applied Mathematics"},{"key":"199168_CR8","doi-asserted-by":"crossref","unstructured":"D. de Werra. Scheduling in sports. (1981). In P. Hansen, editor, Studies on Graphs and Discrete Programming, North Holland, pages 381\u2013395.","DOI":"10.1016\/S0304-0208(08)73478-9"},{"key":"199168_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230150110","volume":"15","author":"D. d. Werra","year":"1985","unstructured":"D. de Werra. (1985). On the multiplication of divisions: The use of graphs for sports scheduling. Networks, 15:125\u2013136.","journal-title":"Networks"},{"key":"199168_CR10","unstructured":"ECRC, Germany. (1995). ECLiPSe Extensions User Manual (Version 3.5.2)."},{"key":"199168_CR11","unstructured":"ECRC, Germany. (1995). ECLiPSe User Manual (Version 3.5.2)."},{"key":"199168_CR12","first-page":"14","volume":"29","author":"J. A. Ferland","year":"1991","unstructured":"J. A. Ferland and C. Fleurent. (1991). Computer aided scheduling for a sport league. INFOR, 29:14\u201325.","journal-title":"INFOR"},{"key":"199168_CR13","unstructured":"Eric N. Gelling and Robert E. Odeh. (1973). On 1-factorizations of the complete graph and the relationship to round robin schedules. In Third Manitoba Conference on Numerical Math., pages 214\u2013221."},{"issue":"2-3","key":"199168_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(92)90059-7","volume":"55","author":"M. L. Ginsberg","year":"1992","unstructured":"M. L. Ginsberg and W. D. Harvey. (1992). Iterative broadening. Artificial Intelligence, 55(2-3):367\u2013383.","journal-title":"Iterative broadening. Artificial Intelligence"},{"key":"199168_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. Karp. (1973). An n\n5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal of Computation, 2:225\u2013231.","journal-title":"SIAM Journal of Computation"},{"key":"199168_CR16","series-title":"Technical Report","volume-title":"Some matching problems for bipartite graphs","author":"A. Itai","year":"1977","unstructured":"Alon Itai, Michael Rodeh, and Steven L. Tanimoto. (1977). Some matching problems for bipartite graphs. Technical Report TR93, IBM Israel Scientific Center, Haifa, Israel."},{"key":"199168_CR17","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Joxan Jaffar and Michael Maher. (1994). Constraint logic programming: a survey. Journal of Logic Programming, 19\/20:503\u2013581.","journal-title":"Journal of Logic Programming"},{"key":"199168_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(93)90047-K","volume":"16","author":"T. L. Provost","year":"1993","unstructured":"Thierry Le Provost and Mark Wallace. (1993). Generalized constraint propagation over the CLP scheme. Journal of Logic Programming, 16:319\u2013359.","journal-title":"Journal of Logic Programming"},{"key":"199168_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(76)90017-4","volume":"20","author":"C. C. Lindner","year":"1976","unstructured":"Charles C. Lindner, Eric Mendelsohn, and Alexander Rosa. (1976). On the number of 1-factorizations of the complete graph. Journal of Combinatorial Theory, Series B 20:265\u2013282.","journal-title":"Journal of Combinatorial Theory"},{"key":"199168_CR20","unstructured":"Ken McAloon, Carol Tretkoff, and Gerhard Wetzel. (1997). Sport league scheduling. In Annual ILOG Optimization Users Conference."},{"key":"199168_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/jgt.3190090104","volume":"9","author":"E. Mendelsohn","year":"1985","unstructured":"Eric Mendelsohn and Alexander Rosa. (1985). One-factorizations of the complete graph \u2013 a survey. Journal of Graph Theory, 9:43\u201365.","journal-title":"Journal of Graph Theory"},{"key":"199168_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161\u2013205.","journal-title":"Artificial Intelligence"},{"key":"199168_CR23","unstructured":"George Nemhauser and Michael Trick. (1997). Scheduling a major college basketball conference. In Proc.of the 2nd Int. Conf. on the Practice and Theory of Automated Timetabling, pages 334\u2013336."},{"key":"199168_CR24","unstructured":"Jean-Charles R\u00e9gin. (1994). A filtering algorithm for constraints of difference in CSPs. In Proc. of the 12th Nat. Conf. on Artificial Intelligence (AAAI-94), pages 362\u2013367."},{"key":"199168_CR25","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0166-218X(82)90051-8","volume":"4","author":"A. Rosa","year":"1982","unstructured":"Alexander Rosa and Walter D. Wallis. (1982). Premature sets of 1-factors or how not to schedule round robin tournaments. Discrete Applied Mathematics, 4:291\u2013297.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"199168_CR26","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1093\/biomet\/67.1.127","volume":"67","author":"K. G. Russell","year":"1980","unstructured":"K. G. Russell. (1980). Balancing carry-over effects in round robin tournaments. Biometrika, 67(1):127\u2013131.","journal-title":"Biometrika"},{"key":"199168_CR27","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BFb0120907","volume":"13","author":"J. A. M. Schreuder","year":"1980","unstructured":"J. A. M. Schreuder. (1980). Constructing timetables for sport competitions. Mathematical Programming Study, 13:58\u201367.","journal-title":"Mathematical Programming Study"},{"key":"199168_CR28","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0166-218X(92)90252-6","volume":"35","author":"J. A. M. Schreuder","year":"1992","unstructured":"J. A. M. Schreuder. (1992). Combinatorial aspects of construction of competition dutch professional football leagues. Discrete Applied Mathematics, 35:301\u2013312.","journal-title":"Discrete Applied Mathematics"},{"key":"199168_CR29","volume-title":"Construction of fixture lists for professional football leagues","author":"J. A. M. Schreuder","year":"1993","unstructured":"J. A. M. Schreuder. (1993). Construction of fixture lists for professional football leagues. PhD thesis, Department of Management Science, The University of Strathclyde, Glasgow."},{"key":"199168_CR30","first-page":"193","volume":"15","author":"T. H. Straley","year":"1983","unstructured":"T. H. Straley. (1983). Scheduling designs for a league tournament. Ars Combinatorica, 15:193\u2013200.","journal-title":"Ars Combinatorica"},{"key":"199168_CR31","unstructured":"Pascal Van Hentenryck. (1989). Constraint Satisfaction in Logic Programming. MIT Press."},{"key":"199168_CR32","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0069907","volume-title":"Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices","author":"W. D. Wallis","year":"1972","unstructured":"W. D. Wallis, A. P. Street, and J. S. Wallis. (1972). Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices. Number 292 in Lecture Notes in Mathematics. New York: Springer-Verlag."},{"key":"199168_CR33","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1017\/S0334270000002927","volume":"24","author":"W. D. Wallis","year":"1983","unstructured":"W. D. Wallis. (1983). A tournament problem. Journal of the Australian Mathematical Society, Series B 24:289\u2013291.","journal-title":"Journal of the Australian Mathematical Society"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009845710839.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009845710839\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009845710839.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:03:21Z","timestamp":1752379401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009845710839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["199168"],"URL":"https:\/\/doi.org\/10.1023\/a:1009845710839","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}