{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:16:09Z","timestamp":1774926969963,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10951-010-0194-9","type":"journal-article","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T01:18:04Z","timestamp":1284513484000},"page":"117-125","source":"Crossref","is-referenced-by-count":9,"title":["Using a SAT-solver to schedule sports leagues"],"prefix":"10.1007","volume":"15","author":[{"given":"Andrei","family":"Horbach","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Bartsch","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Briskorn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"194_CR1","doi-asserted-by":"crossref","first-page":"1907","DOI":"10.1016\/j.cor.2004.09.037","volume":"33","author":"T. Bartsch","year":"2006","unstructured":"Bartsch, T., Drexl, A., & Kr\u00f6ger, S. (2006). Scheduling the Professional Soccer Leagues of Austria and Germany. Computers & Operations Research, 33, 1907\u20131937.","journal-title":"Computers & Operations Research"},{"key":"194_CR2","unstructured":"Briskorn, D. (2009). A branching scheme for minimum cost tournaments with regard to real world constraints (Working Paper)."},{"key":"194_CR3","first-page":"523","volume-title":"Operations research proceedings 2006\u2014selected papers of the annual international conference of the german operations research society (GOR)","author":"D. Briskorn","year":"2007","unstructured":"Briskorn, D., & Drexl, A. (2007). Branching based on home\u2013away\u2013pattern sets. In K.-H. Waldmann & U. M. Stocker (Eds.), Operations research proceedings 2006\u2014selected papers of the annual international conference of the german operations research society (GOR) (pp.\u00a0523\u2013528). Karlsruhe, September 6th\u20138th 2006. Berlin: Springer."},{"issue":"1","key":"194_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2008.06.008","volume":"197","author":"D. Briskorn","year":"2009","unstructured":"Briskorn, D., & Drexl, A. (2009). A branching scheme for finding cost-minimal round robin tournaments. European Journal of Operational Research, 197(1), 68\u201376.","journal-title":"European Journal of Operational Research"},{"key":"194_CR5","doi-asserted-by":"crossref","unstructured":"Briskorn, D., Drexl, A., & Spieksma, F. C. R. (2010, to appear). Round robin tournaments and three index assignment. 4OR.","DOI":"10.1007\/s10288-010-0123-y"},{"key":"194_CR6","volume-title":"Complex scheduling","author":"P. Brucker","year":"2006","unstructured":"Brucker, P., & Knust, S. (2006). Complex scheduling. Berlin: Springer."},{"issue":"3","key":"194_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7(3), 201\u2013215. ISSN 0004-5411.","journal-title":"Journal of the ACM"},{"issue":"7","key":"194_CR8","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem-proving. Communications of the ACM, 5(7), 394\u2013397.","journal-title":"Communications of the ACM"},{"key":"194_CR9","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","volume":"2","author":"D. Werra de","year":"1980","unstructured":"de Werra, D. (1980). Geography, games and graphs. Discrete Applied Mathematics, 2, 327\u2013337.","journal-title":"Discrete Applied Mathematics"},{"key":"194_CR10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0304-0208(08)73478-9","volume-title":"Studies on graphs and discrete programming","author":"D. Werra de","year":"1981","unstructured":"de Werra, D. (1981). Scheduling in sports. In P. Hansen (Ed.), Studies on graphs and discrete programming (pp.\u00a0381\u2013395). Amsterdam: North-Holland."},{"key":"194_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(82)90042-7","volume":"4","author":"D. Werra de","year":"1982","unstructured":"de Werra, D. (1982). Minimizing irregularities in sports schedules using graph theory. Discrete Applied Mathematics, 4, 217\u2013226.","journal-title":"Discrete Applied Mathematics"},{"key":"194_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230150110","volume":"15","author":"D. Werra de","year":"1985","unstructured":"de Werra, D. (1985). On the multiplication of divisions: the use of graphs for sports scheduling. Networks, 15, 125\u2013136.","journal-title":"Networks"},{"key":"194_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(88)90033-9","volume":"21","author":"D. Werra de","year":"1988","unstructured":"de Werra, D. (1988). Some models of graphs for scheduling sports competitions. Discrete Applied Mathematics, 21, 47\u201365.","journal-title":"Discrete Applied Mathematics"},{"key":"194_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.dam.2005.03.011","volume":"154","author":"D. Werra de","year":"2006","unstructured":"de Werra, D., Ekim, T., & Raess, C. (2006). Construction of sports schedules with multiple venues. Discrete Applied Mathematics, 154, 47\u201358.","journal-title":"Discrete Applied Mathematics"},{"key":"194_CR15","doi-asserted-by":"crossref","first-page":"1963","DOI":"10.1016\/j.cor.2004.09.025","volume":"33","author":"F. Croce Della","year":"2006","unstructured":"Della Croce, F., & Oliveri, D. (2006). Scheduling the italian football league: an ILP-approach. Computers & Operations Research, 33, 1963\u20131974.","journal-title":"Computers & Operations Research"},{"key":"194_CR16","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.omega.2005.08.002","volume":"35","author":"A. Drexl","year":"2007","unstructured":"Drexl, A., & Knust, S. (2007). Sports league scheduling: graph- and resource-based models. Omega, 35, 465\u2013471.","journal-title":"Omega"},{"key":"194_CR17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1287\/inte.1070.0318","volume":"37","author":"G. Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n, G., Guajardo, M., Miranda, J., Saur\u00e9, D., & Weintraub, A. (2007). Scheduling the chilean soccer league by integer programming. Interfaces, 37, 539\u2013552.","journal-title":"Interfaces"},{"key":"194_CR18","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"An extensible SAT-solver","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2004). Theory and applications of satisfiability testing. In Lecture notes in computer science. An extensible SAT-solver (pp.\u00a0502\u2013518). Berlin: Springer."},{"key":"194_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1574-6526(07)03002-7","volume-title":"Handbook of knowledge representations","author":"C. P. Gomes","year":"2008","unstructured":"Gomes, C. P., Kautz, H., Sabharwal, A., & Selman, B. (2008). Satisfiability solvers. In Handbook of knowledge representations (pp.\u00a089\u2013132). Amsterdam: Elsevier."},{"issue":"2","key":"194_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1287\/inte.1080.0402","volume":"39","author":"D. Goossens","year":"2009","unstructured":"Goossens, D., & Spieksma, F. (2009). Scheduling the belgian soccer league. Interfaces, 39(2), 109\u2013118.","journal-title":"Interfaces"},{"key":"194_CR21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A. (1985). The intractability of resolution. Theoretical Computer Science, 39, 297\u2013308.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"194_CR22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/opre.49.1.163.11193","volume":"49","author":"M. Henz","year":"2001","unstructured":"Henz, M. (2001). Scheduling a major college basketball conference\u2013revisited. Operations Research, 49(1), 163.","journal-title":"Operations Research"},{"key":"194_CR23","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1057\/palgrave.jors.2602382","volume":"59","author":"G. Kendall","year":"2008","unstructured":"Kendall, G. (2008). Scheduling english football fixtures over holiday periods. Journal of the Operational Research Society, 59, 743\u2013755.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"194_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G. Kendall","year":"2010","unstructured":"Kendall, G., Knust, S., Ribeiro, C. C., & Urrutia, S. (2010). Invited review: Scheduling in sports: An annotated bibliography. Computers & Operations Research, 37(1), 1\u201319.","journal-title":"Computers & Operations Research"},{"key":"194_CR25","unstructured":"Knust, S. (2009). Classification of literature on sports scheduling. http:\/\/www.inf.uos.de\/knust\/sportlit_class\/ . Accessed January 29th, 2009."},{"key":"194_CR26","doi-asserted-by":"crossref","unstructured":"Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik,\u00a0S. (2001). Chaff: Engineering an efficient SAT solver. In DAC (pp.\u00a0530\u2013535).","DOI":"10.1145\/378239.379017"},{"issue":"3","key":"194_CR27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P. J., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357\u2013391.","journal-title":"Constraints"},{"key":"194_CR28","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.ejor.2006.12.050","volume":"185","author":"R. V. Rasmussen","year":"2008","unstructured":"Rasmussen, R. V. (2008). Scheduling a triple round robin tournament for the best danish soccer league. European Journal of Operational Research, 185, 795\u2013810.","journal-title":"European Journal of Operational Research"},{"key":"194_CR29","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ejor.2005.10.063","volume":"177","author":"R. V. Rasmussen","year":"2007","unstructured":"Rasmussen, R. V., & Trick, M. A. (2007). A benders approach for the constrained minimum break problem. European Journal of Operational Research, 177, 198\u2013213.","journal-title":"European Journal of Operational Research"},{"key":"194_CR30","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R. V. Rasmussen","year":"2008","unstructured":"Rasmussen, R. V., & Trick, M. A. (2008). Round robin scheduling\u2014a survey. European Journal of Operational Research, 188, 617\u2013636.","journal-title":"European Journal of Operational Research"},{"key":"194_CR31","first-page":"149","volume-title":"Lecture notes in computer science","author":"C. C. Ribeiro","year":"2007","unstructured":"Ribeiro, C. C., & Urrutia, S. (2007). Scheduling the Brazilian soccer tournament with fairness and broadcast objectives. In Lecture notes in computer science (Vol.\u00a03867, pp.\u00a0149\u2013159). Berlin: Springer."},{"key":"194_CR32","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":"Schreuder, J. A. M. (1992). Combinatorial aspects of construction of competition dutch professional football leagues. Discrete Applied Mathematics, 35, 301\u2013312.","journal-title":"Discrete Applied Mathematics"},{"key":"194_CR33","doi-asserted-by":"crossref","first-page":"141","DOI":"10.3233\/SAT190034","volume":"3","author":"R. Sebastiani","year":"2007","unstructured":"Sebastiani, R. (2007). Lazy satisfiability modulo theories. Journal on Satisfiability, Boolean Modeling and Computation, 3, 141\u2013224.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"194_CR34","unstructured":"Zhang, H., Li, D., & Shen, H. (2004). A SAT based scheduler for tournament schedules. In Theory and applications of satisfiability testing, 7th international conference, SAT04 (pp.\u00a0191\u2013196)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0194-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0194-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0194-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T18:38:51Z","timestamp":1591900731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0194-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0194-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,16]]}}}