{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:16:46Z","timestamp":1773656206265,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,26]],"date-time":"2010-03-26T00:00:00Z","timestamp":1269561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10288-010-0123-y","type":"journal-article","created":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T14:32:50Z","timestamp":1269527570000},"page":"365-374","source":"Crossref","is-referenced-by-count":12,"title":["Round robin tournaments and three index assignments"],"prefix":"10.1007","volume":"8","author":[{"given":"Dirk","family":"Briskorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Drexl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,26]]},"reference":[{"key":"123_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos A, Michel L, van Hentenryck P, Vergados Y (2006) A simulated annealing approach to the travelling tournament problem. J Schedul 9: 177\u2013193","journal-title":"J Schedul"},{"key":"123_CR2","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. Comput Oper Res 33: 1907\u20131937","journal-title":"Comput Oper Res"},{"key":"123_CR3","unstructured":"Bhattacharyya R (2010) A note on complexity of traveling tournament problem. Technical report, Indian Statistical Institute"},{"issue":"3","key":"123_CR4","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.cor.2007.11.002","volume":"36","author":"D Briskorn","year":"2009","unstructured":"Briskorn D, Drexl A (2009) Integer programming models for round robin tournaments. Comput Oper Res 36(3): 837\u2013852","journal-title":"Comput Oper Res"},{"key":"123_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 Appl Math 2: 327\u2013337","journal-title":"Discrete Appl Math"},{"key":"123_CR6","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 Appl Math 4: 217\u2013226","journal-title":"Discrete Appl Math"},{"key":"123_CR7","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\u2013based models. Omega 35: 465\u2013471","journal-title":"Omega"},{"key":"123_CR8","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":"123_CR9","unstructured":"Easton K (2002) Using integer programming and constraint programming to solve sports scheduling problems. PhD thesis, Georgia Institute of Technology, USA"},{"key":"123_CR10","doi-asserted-by":"crossref","unstructured":"Easton K, Nemhauser G, Trick M (2001) The travelling tournament problem: description and benchmarks. In: Walsh T (ed) Proceedings of principles and practice of constraint programming\u2014CP 2001, pp 580\u2013585","DOI":"10.1007\/3-540-45578-7_43"},{"key":"123_CR11","doi-asserted-by":"crossref","unstructured":"Easton K, Nemhauser G, Trick M (2003) Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Burke E, de Causmaecker P (eds) Proceedings of the 4th international conference on the practice and theory of automated timetabling, lecture notes in computer science 2740. Springer, pp 100\u2013109","DOI":"10.1007\/978-3-540-45157-0_6"},{"key":"123_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0377-2217(83)90078-4","volume":"13","author":"A Frieze","year":"1983","unstructured":"Frieze A (1983) Complexity of a 3\u2013dimensional assignment problem. Eur J Oper Res 13: 161\u2013164","journal-title":"Eur J Oper Res"},{"key":"123_CR13","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: 109\u2013118","journal-title":"Interfaces"},{"key":"123_CR14","doi-asserted-by":"crossref","unstructured":"Hamiez J-P, Hao J-K (2001) Solving the sports league scheduling problem with Tabu Search. In: Lecture notes in computer science 2148. Springer, pp 24\u201336","DOI":"10.1007\/3-540-45612-0_2"},{"key":"123_CR15","first-page":"545","volume-title":"Proceedings of the international conference on logic programming","author":"M Henz","year":"1999","unstructured":"Henz M (1999) Constraint\u2013based round robin tournament planning. In: de Schreye D (eds) Proceedings of the international conference on logic programming. MIT Press, Las Cruces, pp 545\u2013557"},{"key":"123_CR16","unstructured":"Henz M (2004) Playing with constraint programming and large neighborhood search for travelling tournaments. In: Burke E, Trick M (eds) Proceedings of the 5th international conference on the practice and theory of automated timetabling, pp 23\u201332"},{"key":"123_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00229300","volume":"8","author":"D Magos","year":"1996","unstructured":"Magos D (1996) Tabu search for the planar three\u2013index assignment problem. J Glob Optim 8: 35\u201348","journal-title":"J Glob Optim"},{"key":"123_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(94)90034-5","volume":"77","author":"D Magos","year":"1994","unstructured":"Magos D, Miliotis P (1994) An algorithm for the planar three\u2013index assignment problem. Eur J Oper Res 77: 141\u2013153","journal-title":"Eur J Oper Res"},{"key":"123_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/jgt.3190090104","volume":"9","author":"E Mendelsohn","year":"1985","unstructured":"Mendelsohn E, Rosa A (1985) One factorizations of the complete graph\u2014a survey. J Graph Theory 9: 43\u201365","journal-title":"J Graph Theory"},{"key":"123_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"GL Nemhauser","year":"1998","unstructured":"Nemhauser GL, Trick MA (1998) Scheduling a major college basketball conference. Oper Res 46: 1\u20138","journal-title":"Oper Res"},{"key":"123_CR21","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"RV Rasmussen","year":"2008","unstructured":"Rasmussen RV, Trick MA (2008) Round robin scheduling\u2014a survey. Eur J Oper Res 188: 617\u2013636","journal-title":"Eur J Oper Res"},{"key":"123_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3155-2_1","volume-title":"Nonlinear assignment problems, algorithms and applications","author":"FCR Spieksma","year":"2000","unstructured":"Spieksma FCR (2000) Multi index assignment problems: complexity, approximation, applications. In: Pitsoulis L, Pardalos P (eds) Nonlinear assignment problems, algorithms and applications. Kluwer, Dordrecht, pp 1\u201312"},{"key":"123_CR23","first-page":"63","volume-title":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, lecture notes in computer science 2740","author":"MA Trick","year":"2003","unstructured":"Trick MA (2003) Integer and constraint programming approaches for round robin tournament scheduling. In: Burke E, de Causmaecker P (eds) Proceedings of the 4th international conference on the practice and theory of automated timetabling, lecture notes in computer science 2740. Springer, Berlin, pp 63\u201377"},{"key":"123_CR24","doi-asserted-by":"crossref","first-page":"1932","DOI":"10.1016\/j.dam.2006.03.030","volume":"154","author":"S Urrutia","year":"2006","unstructured":"Urrutia S, Ribeiro CC (2006) Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discrete Appl Math 154: 1932\u20131938","journal-title":"Discrete Appl Math"},{"key":"123_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-10631-6_69","volume-title":"An improved approximation algorithm for the traveling tournament problem","author":"D Yamaguchi","year":"2009","unstructured":"Yamaguchi D, Imahori S, Miyashiro R, Matsui T (2009) An improved approximation algorithm for the traveling tournament problem. University of Tokyo, Technical report"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0123-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-010-0123-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0123-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:56Z","timestamp":1559131976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-010-0123-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,26]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["123"],"URL":"https:\/\/doi.org\/10.1007\/s10288-010-0123-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,26]]}}}