{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T09:29:46Z","timestamp":1778232586270,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T00:00:00Z","timestamp":1501113600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002749","name":"Belgian Science Policy Office","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002749","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Leuven Mobility Research Centre"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-017-2595-z","type":"journal-article","created":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T11:01:34Z","timestamp":1501153294000},"page":"223-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The sport teams grouping problem"],"prefix":"10.1007","volume":"275","author":[{"given":"T\u00falio A. M.","family":"Toffolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Christiaens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greet","family":"Vanden Berghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"issue":"1","key":"2595_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., & Martin, A. (2005). Branching rules revisited. Operations Research Letters, 33(1), 42\u201354.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2595_CR2","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/inte.2016.0861","volume":"47","author":"F Alarc\u00f3n","year":"2017","unstructured":"Alarc\u00f3n, F., Dur\u00e1n, G., Guajardo, M., Miranda, J., Mu\u00f1oz, H., Ram\u00edrez, L., et al. (2017). Operations research transforms the scheduling of chilean soccer leagues and south american world cup qualifiers. Interfaces, 47(1), 52\u201369.","journal-title":"Interfaces"},{"key":"2595_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2016.04.002","volume":"211(c)","author":"Z Ales","year":"2016","unstructured":"Ales, Z., Knippel, A., & Pauchet, A. (2016). Polyhedral combinatorics of the k-partitioning problem with representative variables. Discrete Applied Mathematics, 211(c), 1\u201314.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2595_CR4","doi-asserted-by":"publisher","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 traveling tournament problem. Journal of Scheduling, 9(2), 177\u2013193.","journal-title":"Journal of Scheduling"},{"key":"2595_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"issue":"4","key":"2595_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10288-010-0123-y","volume":"8","author":"D Briskorn","year":"2010","unstructured":"Briskorn, D., Drexl, A., & Spieksma, F. C. R. (2010). Round robin tournaments and three index assignments. 4OR, 8(4), 365\u2013374.","journal-title":"4OR"},{"issue":"4","key":"2595_CR7","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/j.cie.2012.08.002","volume":"63","author":"MAMD Carvalho","year":"2012","unstructured":"Carvalho, M. A. M. D., & Lorena, L. A. N. (2012). New models for the mirrored traveling tournament problem. Computers and Industrial Engineering, 63(4), 1089\u20131095.","journal-title":"Computers and Industrial Engineering"},{"key":"2595_CR8","unstructured":"Christiaens, J., & Vanden Berghe, G. (2016). A fresh ruin & recreate implementation for the capacitated vehicle routing problem. Technical report, KU Leuven, Belgium."},{"issue":"1","key":"2595_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101\u2013111.","journal-title":"Operations Research"},{"issue":"2","key":"2595_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10732-006-9007-x","volume":"13","author":"L Gaspero Di","year":"2007","unstructured":"Di Gaspero, L., & Schaerf, A. (2007). A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics, 13(2), 189\u2013207.","journal-title":"Journal of Heuristics"},{"key":"2595_CR11","unstructured":"Easton, K., Nemhauser, G., & Trick, M. (2001). The traveling tournament problem description and benchmarks. In T. Walsh (Ed.), Principles and Practice of Constraint Programming\u2014CP 2001: 7th International Conference, CP 2001 Paphos, Cyprus, 2001 Proceedings (pp. 580\u2013584). Berlin, Heidelberg: Springer."},{"issue":"2","key":"2595_CR12","doi-asserted-by":"publisher","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":"2595_CR13","unstructured":"Goossens, D., & Spieksma, F. (2014). Indoor football scheduling. In E.\u00a0\u00d6zcan, E.\u00a0Burke, & B.\u00a0McCollum (Eds.), Proceedings of the 10th International Conference on the Practice and Theory of Automated Timetabling (pp. 167\u2013178), PATAT."},{"issue":"5","key":"2595_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10951-011-0238-9","volume":"15","author":"DR Goossens","year":"2012","unstructured":"Goossens, D. R., & Spieksma, F. C. R. (2012). Soccer schedules in europe: An overview. Journal of Scheduling, 15(5), 641\u2013651.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"2595_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.03.038","volume":"254","author":"T Januario","year":"2016","unstructured":"Januario, T., Urrutia, S., Ribeiro, C. C., & De Werra, D. (2016). Edge coloring: A natural model for sports scheduling. European Journal of Operational Research, 254(1), 1\u20138.","journal-title":"European Journal of Operational Research"},{"key":"2595_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2006.10.009","volume":"4","author":"X Ji","year":"2007","unstructured":"Ji, X., & Mitchell, J. E. (2007). Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discrete Optimization, 4, 87\u2013102.","journal-title":"Discrete Optimization"},{"issue":"1","key":"2595_CR17","doi-asserted-by":"publisher","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). Scheduling in sports: An annotated bibliography. Computers and Operations Research, 37(1), 1\u201319.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2595_CR18","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ejor.2009.01.015","volume":"200","author":"S Knust","year":"2010","unstructured":"Knust, S. (2010). Scheduling non-professional table-tennis leagues. European Journal of Operational Research, 200(2), 358\u2013367.","journal-title":"European Journal of Operational Research"},{"issue":"24","key":"2595_CR19","doi-asserted-by":"publisher","first-page":"3473","DOI":"10.1016\/j.disc.2010.08.009","volume":"310","author":"M Labb\u00e9","year":"2010","unstructured":"Labb\u00e9, M., & \u00d6zsoy, F. A. (2010). Size-constrained graph partitioning polytopes. Discrete Mathematics, 310(24), 3473\u20133493.","journal-title":"Discrete Mathematics"},{"issue":"6","key":"2595_CR20","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"issue":"1","key":"2595_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., & Trick, M. A. (1998). Cliques and clustering: A combinatorial approach. Operations Research Letters, 22(1), 1\u201312.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2595_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"GL Nemhauser","year":"1998","unstructured":"Nemhauser, G. L., & Trick, M. A. (1998). Scheduling a major college basketball conference. Operations Research, 46(1), 1\u20138.","journal-title":"Operations Research"},{"key":"2595_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1111\/j.1475-3995.2011.00819.x","volume":"19","author":"CC Ribeiro","year":"2012","unstructured":"Ribeiro, C. C. (2012). Sports scheduling: Problems and applications. International Transactions in Operational Research, 19, 201\u2013226.","journal-title":"International Transactions in Operational Research"},{"key":"2595_CR24","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nberger, J., Mattfeld, D., & Kopfer, H. (2000). Automated timetable generation for rounds of a table-tennis league. In Proceedings of the 2000 Congress on Evolutionary Computation (pp. 277\u2013284).","DOI":"10.1109\/CEC.2000.870307"},{"issue":"1","key":"2595_CR25","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S0377-2217(03)00102-4","volume":"153","author":"J Sch\u00f6nberger","year":"2004","unstructured":"Sch\u00f6nberger, J., Mattfeld, D., & Kopfer, H. (2004). Memetic algorithm timetabling for non-commercial sport leagues. European Journal of Operational Research, 153(1), 102\u2013116.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2595_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM S\u00f8rensen","year":"2004","unstructured":"S\u00f8rensen, M. M. (2004). New facets and a branch-and-cut algorithm for the weighted clique problem. European Journal of Operational Research, 154(1), 57\u201370.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2595_CR27","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2015.10.004","volume":"250","author":"TAM Toffolo","year":"2016","unstructured":"Toffolo, T. A. M., Wauters, T., Van Malderen, S., & Vanden Berghe, G. (2016). Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem. European Journal of Operational Research, 250(3), 737\u2013744.","journal-title":"European Journal of Operational Research"},{"key":"2595_CR28","doi-asserted-by":"crossref","unstructured":"Trick, M.A., & Yildiz, H. (2007). Bender\u2019s cuts guided large neighborhood search for the traveling umpire problem. In P. Van Hentenryck & L. Wolsey (Eds.), Number 4510 in Lecture Notes in Computer Science (pp. 332\u2013345), Springer.","DOI":"10.1007\/978-3-540-72397-4_24"},{"issue":"8","key":"2595_CR29","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1002\/nav.20482","volume":"58","author":"MA Trick","year":"2011","unstructured":"Trick, M. A., & Yildiz, H. (2011). Benders\u2019 cuts guided large neighborhood search for the traveling umpire problem. Naval Research Logistics (NRL), 58(8), 771\u2013781.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"2595_CR30","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/inte.1100.0514","volume":"42","author":"MA Trick","year":"2012","unstructured":"Trick, M. A., Yildiz, H., & Yunes, T. (2012). Scheduling major league baseball umpires and the traveling umpire problem. Interfaces, 42(3), 232\u2013244.","journal-title":"Interfaces"},{"issue":"5","key":"2595_CR31","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s10951-011-0237-x","volume":"15","author":"DC Uthus","year":"2011","unstructured":"Uthus, D. C., Riddle, P. J., & Guesgen, H. W. (2011). Solving the traveling tournament problem with iterative-deepening. Journal of Scheduling, 15(5), 601\u2013614.","journal-title":"Journal of Scheduling"},{"key":"2595_CR32","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 years of integer programming 1958\u20132008","author":"F Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., & Wolsey, L. (2010). Reformulation and decomposition of integer. In M. J\u00fcnger, T. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, & L. A. Wolsey (Eds.), 50 years of integer programming 1958\u20132008 (pp. 431\u2013502). Berlin: Springer."},{"issue":"3","key":"2595_CR33","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1016\/j.ejor.2014.12.038","volume":"243","author":"L Xue","year":"2015","unstructured":"Xue, L., Luo, Z., & Lim, A. (2015). Two exact algorithms for the traveling umpire problem. European Journal of Operational Research, 243(3), 932\u2013943.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2595-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2595-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2595-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,19]],"date-time":"2020-01-19T00:05:28Z","timestamp":1579392328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2595-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,27]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["2595"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2595-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,27]]},"assertion":[{"value":"27 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}