{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:12:37Z","timestamp":1648721557153},"reference-count":13,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T00:00:00Z","timestamp":1316563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"DOI":"10.1007\/s10479-011-0981-5","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T10:53:04Z","timestamp":1316515984000},"source":"Crossref","is-referenced-by-count":0,"title":["Round-robin tournaments with homogeneous rounds"],"prefix":"10.1007","author":[{"given":"Bregje","family":"Buiteveld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"van Holland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Post","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Smit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"key":"981_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jctb.2000.1996","volume":"81","author":"B. Alspach","year":"2001","unstructured":"Alspach, B., & Gavlas, H. (2001). Cycle decompositions of K n and K n \u2212I. Journal of Combinatorial Theory. Series B, 81, 77\u201399.","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"981_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0097-3165(03)00098-0","volume":"103","author":"B. Alspach","year":"2003","unstructured":"Alspach, B., Gavlas, H., \u0160ajna, M., & Verrall, H. (2003). Cycle decompositions IV: complete directed graphs and fixed length directed cycles. Journal of Combinatorial Theory. Series A, 103, 165\u2013208.","journal-title":"Journal of Combinatorial Theory. Series A"},{"key":"981_CR3","volume-title":"The CRC handbook of combinatorial designs","author":"C. Colbourn","year":"2007","unstructured":"Colbourn, C., & Dinitz, J. (2007). The CRC handbook of combinatorial designs. Boca Raton: CRC Press."},{"key":"981_CR4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s00493-008-2384-z","volume":"28","author":"D. Dokovi\u0107","year":"2008","unstructured":"Dokovi\u0107, D. (2008). Hadamard matrices of order 764 exist. Combinatorica, 28, 487\u2013489.","journal-title":"Combinatorica"},{"key":"981_CR5","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":"981_CR6","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":"981_CR7","first-page":"331","volume-title":"Proceedings of the 1st international conference on multidisciplinary scheduling: theory and applications","author":"D. Fron\u010dek","year":"2003","unstructured":"Fron\u010dek, D., & Meszka, M. (2003). Round robin tournaments with one bye and no breaks in home-away patterns are unique. In Proceedings of the 1st international conference on multidisciplinary scheduling: theory and applications, Nottingham, UK (pp.\u00a0331\u2013340)."},{"key":"981_CR8","first-page":"191","volume":"2","author":"T. P. Kirkman","year":"1847","unstructured":"Kirkman, T. P. (1847). On a problem in combinations. Cambridge and Dublin Mathematics Journal, 2, 191\u2013204.","journal-title":"Cambridge and Dublin Mathematics Journal"},{"key":"981_CR9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.orl.2007.11.006","volume":"36","author":"S. Knust","year":"2008","unstructured":"Knust, S. (2008). Scheduling sports tournaments on a single court minimizing waiting times. Operations Research Letters, 36, 471\u2013476.","journal-title":"Operations Research Letters"},{"key":"981_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.disopt.2005.08.009","volume":"3","author":"G. Post","year":"2006","unstructured":"Post, G., & Woeginger, G. (2006). Sports tournaments, home-away assignments, and the break minimization problem. Discrete Optimization, 3, 165\u2013173.","journal-title":"Discrete Optimization"},{"key":"981_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/jcd.1027","volume":"10","author":"M. \u0160ajna","year":"2002","unstructured":"\u0160ajna, M. (2002). Cycle decompositions III: Complete graphs and fixed length cycles. Journal of Combinatorial Designs, 10, 27\u201377.","journal-title":"Journal of Combinatorial Designs"},{"key":"981_CR12","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":"981_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BFb0055890","volume-title":"PATAT 1997","author":"A. Weert van","year":"1998","unstructured":"van Weert, A., & Schreuder, J. A. M. (1998). Construction of basic match schedules for sports competitions by using graph theory. In E. Burke & M. Carter (Eds.), Lecture notes in computer science: Vol.\u00a01408. PATAT 1997 (pp.\u00a0201\u2013210). Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0981-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0981-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0981-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:09Z","timestamp":1559153289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0981-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,21]]},"references-count":13,"alternative-id":["981"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0981-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,21]]}}}