Related Topics
TO DO
Glossario
Classification of Literature on Sports Scheduling
Tipi di squadre
Literature on Sports Scheduling
Basic Scheduling Terminology
CONSTELLATION GRAPH
Constellation Census
Constellation Iustitia
Constellation Gare
Rimborsi arbitrali AIA
ASSYRIAN GRAMMAR
Medial begabte Damen
Ultima Thule
Classification of Literature on Sports Scheduling  
Classification of Literature on Sports Scheduling
(maintained by Sigrid Knust) http://www2.informatik.uni-osnabrueck.de/knust/sportssched/sportlit_class/


Classification of Literature on Sports Scheduling
Classification of Literature on Sports Scheduling (maintained by Sigrid Knust)
In the following we collect references on different topics of sports scheduling and classify them according to different aspects.
Surveys
Dinitz et al. [64], Drexl & Knust [68], Easton et al. [78], Kendall et al. [133], Rasmussen & Trick [183], Ribeiro [188], Wright [259]
Models

* Graphs:
Burrows & Tuffley [42], Dinitz et al. [64], Drexl & Knust [68], Easton et al. [78], Froncek [91], Ikebe & Tamura [128], Kendall et al. [133], Knust [140], Knust & von Thaden [143], Lewis & Thompson [156], Mendelsohn & Rosa [163], Rosa & Wallis [197], Russell [198], Schreuder [208], Schreuder [209], Schreuder [210], Wallis [239], van Weert & Schreuder [242], de Werra [244], de Werra [245], de Werra [246], de Werra [247], de Werra [248], de Werra et al. [249]

* One-Factorizations:
Briskorn [31], Briskorn [29], Burrows & Tuffley [42], Cheung [46], Dinitz et al. [64], Easton et al. [78], Froncek [91], Gelling & Odeh [94], Griggs & Rosa [102], Hwang [127], Kirkman [139], Mendelsohn & Rosa [163], Rosa & Wallis [197], Schreuder [208], Schreuder [210], Straley [211], de Werra [244], de Werra [245], de Werra [246], de Werra [248], de Werra et al. [249]

* Two-Factorizations:
Briskorn [31], Briskorn [29], Knust [140], van Weert & Schreuder [242]
Single-Round-Robin Tournament (SRRT):
Briskorn [28], Briskorn [31], Briskorn [29], Briskorn [32], Briskorn & Drexl [34], Briskorn & Horbach [37], Briskorn et al. [36], Buiteveld et al. [40], Della Croce et al. [58], Dinitz & Froncek [63], Dinitz et al. [64], Duran et al. [71], Duran et al. [72], Duran et al. [73], Easton et al. [78], Froncek & Meszka [90], Henz [113], Henz et al. [117], Henz et al. [118], Kendall et al. [133], Knust & Lücking [142], Knust & von Thaden [143], Lewis & Thompson [156], Melo et al. [161], Miyashiro & Matsui [169], Noronha et al. [172], Post & Woeginger [181], Rasmussen & Trick [183], Rodney [196], Suzuka et al. [214], Trick [221], Urban & Russell [229], Uthus et al. [232], van't Hof et al. [238], van Weert & Schreuder [242], de Werra [244], de Werra [245], de Werra [246]

* Double-Round-Robin Tournament (DRRT):
Bonomo et al. [27], Briskorn [29], Briskorn et al. [36], Buiteveld et al. [40], Della Croce & Oliveri [59], Dinitz & Froncek [63], Drexl & Knust [68], Easton [75], Easton et al. [78], Froncek [91], Goossens & Spieksma [98], Henz [115], Henz et al. [117], Henz et al. [118], Horbach et al. [120], Kendall et al. [133], Knust & Lücking [142], Nemhauser & Trick [171], Panton et al. [179], Perron [180], Rasmussen & Trick [183], Rasmussen & Trick [184], Ribeiro & Urrutia [191], Ribeiro & Urrutia [192], Ribeiro & Urrutia [194], Schaerf [204], Suzuka et al. [216], Suzuka et al. [213], Walser [240], de Werra [245], de Werra et al. [249], Zeng & Mizuno [265]

* Bipartite Tournaments:
Anderson [8], Anderson & Bailey [9], Froncek [91], de Werra [245]

* Balanced Tournament Design (BTD):
Aggoun & Vazacopoulos [3], Anderson [7], Blest & Fitzgerald [26], Corriveau [51], Dinitz [61], Dinitz & Dinitz [62], Dinitz & Stinson [66], Dinitz et al. [64], Easton et al. [78], Finizio [87], Franek et al. [89], Geinoz et al. [93], Gelling & Odeh [94], Gomes et al. [96], Hamiez & Hao [107], Hamiez & Hao [108], Hamiez & Hao [110], Hamiez & Hao [109], Haselgrove & Leech [111], Horton [121], Ikebe & Tamura [128], Kendall et al. [133], Lamken [148], Lamken [149], Lamken [150], Lamken & Vanstone [151], Lamken & Vanstone [152], Lamken & Vanstone [153], Lamken & Vanstone [154], McAloon et al. [160], Mendelsohn & Rodney [164], Rodney [196], Schellenberg et al. [205], de Werra et al. [250]

* Traveling Tournament Problem (TTP):
Adriaen et al. [2], Anagnostopoulos [5], Anagnostopoulos [6], Araújo et al. [12], Bar-Noy & Moody [15], Benoist et al. [22], Bonomo et al. [27], Cheung [46], Cheung [47], Carvalho & Loreno [45], Costa et al. [53], Crauwels & Van Oudheusden [56], Di Gaspero & Schaerf [60], Easton [75], Easton et al. [76], Easton et al. [77], Easton et al. [78], Fujiwara et al. [92], Goerigk & Westphal [95], Gschwind & Irnich [103], Hoshino & Kawarabayashi [122], Hoshino & Kawarabayashi [123], Hoshino & Kawarabayashi [124], Hoshino & Kawarabayashi [125], Imahori et al. [129], Irnich [130], Henz [116], Kendall et al. [134], Kendall et al. [133], Khelifa & Boughaci [138], Lee et al. [155], Lim et al. [158], Melo et al. [162], Miyashiro et al. [170], Rasmussen & Trick [184], Rasmussen & Trick [185], Ribeiro [188], Ribeiro & Urrutia [193], Tajbakhsh et al. [217], Thielen & Westphal [218], Thielen & Westphal [219], Urrutia & Ribeiro [230], Urrutia et al. [231], Uthus et al. [233], Uthus et al. [234], Uthus et al. [235], Westphal & Noparlik [252], Yamaguchi et al. [262], Yamaguchi et al. [263]

* Time-relaxed problems:
Knust [141], Schönberger et al. [206], Schönberger et al. [207]

* Latin Squares:
Anderson [8], Anderson & Bailey [9], Colbourn [48], Colbourn [49], Dinitz et al. [64], Easton [75], Easton et al. [78], Easton & Parker [79], Rosa & Wallis [197]

* Combinatorial Designs:
Anderson [8], Colbourn [48], Colbourn & Dinitz [50], Dinitz et al. [64], Kirkman [139], Triska & Musliu [227], Triska & Musliu [228]

* First break, then schedule (FBTS):
Briskorn [30], Briskorn [32], Briskorn & Drexl [35], Della Croce & Oliveri [59], Easton et al. [78], Goossens & Spieksma [99], Henz [115], Horbach [119], Kendall et al. [133], Knust & Lücking [142], Miyashiro et al. [166], Nemhauser & Trick [171], Panton et al. [179], Rasmussen [182], Rasmussen & Trick [184], Ribeiro & Urrutia [192], Russell & Leung [199], Schreuder [209], Schreuder [210], Zeng & Mizuno [265]

* First schedule, then break (FSTB):
Brouwer et al. [39], Cheung [46], Easton et al. [78], Elf et al. [80], Kendall et al. [133], Miyashiro & Matsui [167], Miyashiro & Matsui [168], Suzuka et al. [213], Suzuka et al. [214], Post & Woeginger [181], Rasmussen & Trick [185], Trick [220]

* Breaks:
Brouwer et al. [39], Easton et al. [78], Elf et al. [80], Froncek [91], Froncek & Meszka [90], Goossens & Spieksma [99], Goossens & Spieksma [100], Kendall et al. [133], Miyashiro et al. [166], Miyashiro & Matsui [167], Miyashiro & Matsui [168], Post & Woeginger [181], Rasmussen & Trick [183], Rasmussen & Trick [184], Regin [187], Ribeiro & Urrutia [191], Ribeiro & Urrutia [192], Suzuka et al. [215], Trick [220], Urrutia & Ribeiro [230], van't Hof et al. [238], de Werra [245], de Werra [248], Zeng & Mizuno [265], Zeng & Mizuno [266]

* Travel Distances:
Ball & Webster [14], Bean & Birge [20], Birge [25], Cain [43], Campbell & Chen [44], Ferland & Fleurent [84], Kendall [132], Mitchell [165], Rasmussen & Trick [183], Rasmussen & Trick [185], Russell & Leung [199], Sakaguchi & Ishizaki [202], Suzuka et al. [213], Suzuka et al. [214], van Voorhis [237], Yang et al. [261]
* Carryover effects:
Anderson [7], Anderson [8], Anderson & Bailey [9], Anderson & Ferguson [10], Beintema et al. [21], Goossens & Spieksma [100], Guedes & Ribeiro [104], Guedes & Ribeiro [105], Hwang [121], Henz et al. [118], Keedwell [131], Kendall et al. [133], Miyashiro & Matsui [169], Ribeiro [188], Russell [198]

* Strength groups:
Briskorn [29], Briskorn [31], Briskorn & Knust [38], van't Hof et al. [238], Zeng & Mizuno [266]

* Costs:
Briskorn [32], Briskorn & Drexl [35], Briskorn & Horbach [37], Knust & Lücking [142], Nurmi et al. [174]
* Venues:
Burke et al. [41], Della Croce et al. [58], Ikebe & Tamura [128], Knust [140], Lim & Zhang [157], Lim et al. [159], Melo et al. [161], Melo et al. [162], Urban & Russell [229], Russell & Urban [200], Su et al. [212], de Werra et al. [250]

* Tournament Planning:
Andreu & Corominas [11], Goossens et al. [97], Kostuk [144], Kujansuu et al. [146]

* League assignment:
Dejonghe [57], Mitchell [165]

* Referee assignment:
Alarcon et al. [4], Dinitz [61], Dinitz & Ling [65], Dinitz & Stinson [66], Duarte et al. [69], Duarte et al. [70], Evans [81], Evans et al. [82], Farmer et al. [83], Kendall et al. [133], Oliveira et al. [178], Trick & Yildiz [223], Trick & Yildiz [224], Trick & Yildiz [225], Trick et al. [226], Wauters et al. [241], Xue et al. [260], Yavuz et al. [264]

* Playoff / first place elimination:
Adler et al. [1], Bernholt & Gülich [23], Bernholt et al. [24], Gusfield & Martel [106], Kern & Paulusma [136], Kern & Paulusma [137], Ribeiro & Urrutia [189], Ribeiro & Urrutia [190], Robinson [195], Russell & van Beek [201]

* Methods
* Integer Programming:
Alarcon et al. [4], Ball & Webster [14], Bonomo et al. [27], Briskorn [28], Briskorn [29], Briskorn [30], Briskorn [32], Briskorn & Drexl [33], Briskorn & Drexl [35], Briskorn & Drexl [34], Carvalho & Loreno [45], Cheung [47], Della Croce & Oliveri [59], Duarte et al. [69], Duarte et al. [70], Duran et al. [71], Duran et al. [72], Duran et al. [73], Duran et al. [74], Easton [75], Easton et al. [77], Easton et al. [78], Fiallos et al. [85], Fleurent & Ferland [88], Goerigk & Westphal [95], Gomes et al. [96], Goossens & Spieksma [98], Grabau [101], Horbach [119], Irnich [130], Kendall et al. [133], Knust & Lücking [142], Kostuk & Willoughby [145], Lee et al. [155], Lim & Zhang [157], Melo et al. [161], Melo et al. [162], Nemhauser & Trick [171], Noronha et al. [172], Nowak et al. [173], Oliveira et al. [178], Panton et al. [179], Rasmussen [182], Rasmussen & Trick [184], Rasmussen & Trick [185], Recalde et al. [186], Ribeiro [188], Ribeiro & Urrutia [189], Ribeiro & Urrutia [191], Ribeiro & Urrutia [192], Ribeiro & Urrutia [194], Robinson [195], Saur et al. [203], Suzuka et al. [216], Suzuka et al. [215], Trick [221], Trick [222], Trick et al. [226], van Voorhis [236], van Voorhis [237], Walser [240], Werners & Wülfing [243], Westphal [251], Zeng & Mizuno [265]

* Constraint Programming:
Aggoun & Vazacopoulos [3], Benoist et al. [22], Dotu & van Hentenryck [67], Easton [75], Easton et al. [77], Easton et al. [78], Gomes et al. [96], Henz [113], Henz [114], Henz [115], Henz [116], Henz et al. [117], Henz et al. [118], Kendall et al. [133], McAloon et al. [160], Perron [180], Rasmussen & Trick [184], Rasmussen & Trick [185], Regin [187], Schaerf [204], Trick [220], Trick [221], Russell & Urban [200], Zeng & Mizuno [265]

* SAT Formulation:
Horbach et al. [120], Triska & Musliu [228]

* Semidefinite Programming:
Miyashiro & Matsui [168], Suzuka et al. [213], Suzuka et al. [214], Suzuka et al. [215]

* Simulated Annealing:
Anagnostopoulos [5], Anagnostopoulos [6], Easton et al. [78], Kendall et al. [133], Khelifa & Boughaci [138], Kyngas et al. [147], Lim & Zhang [157], Lim et al. [159], Lim et al. [158], Nurmi et al. [177], Tajbakhsh et al. [217], Willis & Terrill [253], Wright [255], Wright [257], Wright [258]

* Tabu Search:
Adriaen et al. [2], Bonomo et al. [27], Costa [52], Della Croce et al. [58], Di Gaspero & Schaerf [60], Easton et al. [78], Goerigk & Westphal [95], Hamiez & Hao [107], Kendall et al. [133], Lee et al. [155], Wright [256]

* Genetic Algorithms:
Costa [52], Cotta et al. [54], Craig et al. [55], Huang et al. [126], Kyngas et al. [147], Nurmi et al. [177], Schönberger et al. [206], Schönberger et al. [207], Yang et al. [261]

* Ant Colony Optimization:
Adriaen et al. [2], Crauwels & Van Oudheusden [56], Uthus et al. [232], Uthus et al. [233]

* Heuristics:
Armstrong & Willis [13], Ball & Webster [14], Bartsch [16], Burke et al. [41], Costa et al. [53], Ferland & Fleurent [84], Guedes & Ribeiro [105], Lewis & Thompson [156], Triska & Musliu [227], Wright [254],

* Neighborhood Search:
Duarte et al. [69], Duarte et al. [70], Henz [116], Ribeiro & Urrutia [193], Walser [240], Yavuz et al. [264]

* Branch-and-Bound:
Bartsch [16], Bartsch & Drexl [17], Bartsch et al. [19], Briskorn [28], Briskorn [29], Briskorn [32], Briskorn & Drexl [33], Briskorn & Drexl [35], Duran et al. [71], Irnich [130], Kendall et al. [133], Noronha et al. [172], Suzuka et al. [216], Xue et al. [260]

* Lagrange Relaxation:
Benoist et al. [22]

* Complexity:
Bernholt & Gülich [23], Bernholt et al. [24], Briskorn [31], Briskorn et al. [36], Colbourn [48], Colbourn [49], Duarte et al. [70], Goossens & Spieksma [99], Hoshino & Kawarabayashi [122], Post & Woeginger [181], Thielen & Westphal [218]

* Approximation Algorithms:
Miyashiro et al. [170], Thielen & Westphal [218], Thielen & Westphal [219], Yamaguchi et al. [262], Yamaguchi et al. [263]

* Decision Support System:
Andreu & Corominas [11], Bartsch [16], Ferland & Fleurent [84], Kostuk [144]
Sports Disciplines

* American/Australian Football:
Kyngas et al. [147], Kostuk & Willoughby [145], Mitchell [165]

* Baseball:
Adler et al. [1], Cain [43], Evans [81], Hoshino & Kawarabayashi [122], Hoshino & Kawarabayashi [123], Hoshino & Kawarabayashi [124], Hoshino & Kawarabayashi [125], Oliveira et al. [178], Robinson [195], Russell & Leung [199], Trick et al. [226], Yang et al. [261]

* Basketball:
Ball & Webster [14], Bean & Birge [20], Campbell & Chen [44], Easton [75], Froncek [91], Henz [115], Nemhauser & Trick [171], van Voorhis [236], van Voorhis [237], Walser [240], de Werra et al. [249], Westphal [251], Wright [258]

* Chess:
Kujansuu et al. [146]

* Cricket:
Armstrong & Willis [13], Willis & Terrill [253], Wright [254], Wright [255], Wright [256], Wright [257]

* Golf:
Colbourn & Dinitz [50], Cotta et al. [54], Dinitz et al. [64], Dotu & van Hentenryck [67], Triska & Musliu [227], Triska & Musliu [228]

* Hockey/Icehockey:
Costa [52], Craig et al. [55], Ferland & Fleurent [84], Fleurent & Ferland [88], Nurmi et al. [175], Nurmi et al. [176], Nurmi et al. [177], Russell & van Beek [201]

* Soccer:
Bartsch [16], Bartsch & Drexl [17], Bartsch & Drexl [18], Bartsch et al. [19], Bernholt & Gülich [23], Bernholt et al. [24], Birge [25], Dejonghe [57], Della Croce & Oliveri [59], Duran et al. [71], Duran et al. [72], Duran et al. [73], Duran et al. [74], Fiallos et al. [85], Flatberg et al. [86], Goossens et al. [97], Goossens & Spieksma [98], Goossens & Spieksma [100], Griggs & Rosa [102], Hausken et al. [112], Horbach et al. [120], Kendall [132], Kendall et al. [135], Noronha et al. [172], Panton et al. [179], Rasmussen [182], Recalde et al. [186], Ribeiro [188], Ribeiro & Urrutia [189], Ribeiro & Urrutia [190], Ribeiro & Urrutia [191], Ribeiro & Urrutia [192], Ribeiro & Urrutia [194], Schreuder [209], Schreuder [210], Werners & Wülfing [243], Yavuz et al. [264]

* Softball:
Grabau [101], Saur et al. [203]

* Swimming:
Nowak et al. [173]

* Tennis:
Della Croce et al. [58], Farmer et al. [83]

* Tabletennis:
Knust [141], Schönberger et al. [206], Schönberger et al. [207]

* Volleyball:
Bonomo et al. [27], van Weert & Schreuder [242]

by Sigrid Knust 2015-04-24



next up previous
Next: About this document... Up: sportlit_class Previous: sportlit_class
Bibliography
1
Adler, I., Erera, A.L., Hochbaum, D.S., Olinick, E.V. (2002) Baseball, optimization, and the world wide web, Interfaces 32, 12-22.
2
Adriaen, M., Custers, N., Vanden Berghe, G. (2003) An agent based metaheuristic for the traveling tournament problem, Working Paper, KaHo Sint-Lieven, Gent, Belgium.
3
Aggoun, A., Vazacopoulos, A. (2004) Solving sports scheduling and timetabling problems with constraint programming, in: S. Butenko, J. Gil-Lafuente and P.M. Pardalos (eds.), Economics, Management and Optimization in Sports, Springer, 243-264.
4
Alarcón, F., Duran, G., Guajardod, M. (2014) Referee assignment in the Chilean football league using integer programming and patterns, International Transactions in Operational Research 21, 415-438.
5
Anagnostopoulos, A., Michel, L., van Hentenryck, P., Vergados, Y. (2003) A simulated annealing approach to the traveling tournament problem, Proceedings CPAIOR'03, Montreal.
6
Anagnostopoulos, A., Michel, L., van Hentenryck, P., Vergados, Y. (2006) A simulated annealing approach to the traveling tournament problem, Journal of Scheduling 9, 177-193.
7
Anderson, I. (1997) Combinatorial Designs and Tournaments, Oxford Lecture Series in Mathematics and Its Applications.
8
Anderson, I. (1999) Balancing carry-over effects in tournaments, in: Combinatorial designs and their applications, Chapman & Hall/CRC Res. Notes Math., 403, Boca Raton, FL, 1-16.
9
Anderson, I., Bailey, R.A. (1997) Completeness properties of conjugates of Latin squares based on groups, and an application to bipartite tournaments, Bulletin of the Institute of Combinatorics and its Applications 21, 95-99.
10
Anderson, I., Ferguson, C. (2004) Training schedules balanced for carryover effects, Bulletin of the Institute of Combinatorics and its Applications 40, 5-12.
11
Andreu, R., Corominas, A. (1989) SUCCESS92: a DSS for scheduling the olympic games, Interfaces 19, 1-12.
12
Araújo, A., Boeres, M.C., Rebello, V.E., Ribeiro, C.C., Urrutia, S. (2007) Exploring grid implementations of parallel cooperative metaheuristics: A case study for the mirrored traveling tournament problem, in: K.F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R.F. Hartl (eds.), Metaheuristics: Progress in Complex Systems Optimization, Springer, 297-322.
13
Armstrong, J., Willis, R.J. (1993) Scheduling the cricket World Cup - a case-study, Journal of the Operational Research Society 44, 1067-1072.
14
Ball, B.C., Webster, D.B. (1977) Optimal scheduling for even-numbered team athletic conferences, AIIE Transactions 9, 161-169.
15
Bar-Noy, A., Moody, D. (2006) A tiling approach for fast implementation of the traveling tournament problem, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 367-369.
16
Bartsch, T. (2001) Sportligaplanung - Ein Decision Support System zur Spielplanerstellung (in German), Deutscher Universitätsverlag, Wiesbaden.
17
Bartsch, T., Drexl, A. (2001) Fussball und Operations Research - Attraktive Spielpläne aus dem Computer (in German), OR News 13, 10-14.
18
Bartsch, T., Drexl, A. (2006) Fussballbundesliga-Spielpläne aus dem Computer (in German), OR News Sonderausgabe, 125-129.
19
Bartsch, T., Drexl, A., Kröger, S. (2006) Scheduling the professional soccer leagues of Austria and Germany, Computers and Operations Research 33, 1907-1937.
20
Bean, J.C., Birge, J.R. (1980) Reducing travelling costs and player fatigue in the national basketball association, Interfaces 10, 98-102.
21
Beintema, M.B., Bonn, J.T., Fitzgerald, R.W., Yucas, J.L. (1998) Orderings of finite fields and balanced tournaments, Ars Combinatoria 49, 41-48.
22
Benoist, T., Laburthe, F., Rottembourg, B. (2001) Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems, Proceedings CPAIOR'01, Wye College (Imperial College), Ashford, Kent UK.
23
Bernholt, T., Gülich, A. (2000) Anwendung von Komplexitätstheorie und effizienten Algorithmen auf die Fussballbundesliga (in German), Diplomarbeit, Universität Dortmund.
24
Bernholt, T., Gülich, A., Hofmeister, T., Schmitt, N., Wegener, I. (2002) Komplexitätstheorie, effiziente Algorithmen und die Bundesliga (in German), Informatik Spektrum 16, 488-502.
25
Birge, J.R. (2004) Scheduling a professional sports league in Microsoft Excel: Showing students the value of good modeling and solution techniques, INFORMS Transactions on Education 5.
26
Blest, D.C., Fitzgerald, D.G. (1988) Scheduling sports competitions with a given distribution of times, Discrete Applied Mathematics 22, 9-19.
27
Bonomo, F., Cardemil, A., Durán, G., Marenco, J., Sabán, D. (2012) An application of the traveling tournament problem: the Argentine volleyball league, Interfaces 42, 245-259.
28
Briskorn, D. (2006) Scheduling sport leagues using branch-and-price, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 367-369.
29
Briskorn, D. (2007) Sport leagues scheduling: models, combinatorial properties, and optimization algorithms, Ph.D. thesis, Christian-Albrechts-Universität Kiel, Lecture Notes in Economics and Mathematical Systems, Vol. 603, Springer.
30
Briskorn, D. (2008) Feasibility of home-away-pattern sets for round robin tournaments, Operations Research Letters 36, 283-284.
31
Briskorn, D. (2009) Combinatorial properties of strength groups in round robin tournaments, European Journal of Operational Research 192, 744-754.
32
Briskorn, D. (2009) A branching scheme for minimum cost tournaments with regard to real world constraints, Report 643, Institut für Betriebswirtschaftslehre, Universität Kiel.
33
Briskorn, D., Drexl, A. (2009) A branch-and-price algorithm for scheduling sport leagues, Journal of the Operational Research Society 60, 84-93.
34
Briskorn, D., Drexl, A. (2009) IP models for round robin tournaments, Computers and Operations Research 36, 837-852.
35
Briskorn, D., Drexl, A. (2009) A branching scheme for finding cost-minimal round robin tournaments, European Journal of Operational Research 197, 68-76.
36
Briskorn, D., Drexl, A., Spieksma, F.C.R. (2010) Round tobin tournaments and three index assignments, 4OR 8, 365-374.
37
Briskorn, D., Horbach, A. (2012) A Lagrangian approach for minimum cost single round robin tournaments, Computers and Operations Research 39, 718-727.
38
Briskorn, D., Knust, S. (2010) Constructing fair sports league schedules with regard to strength groups, Discrete Applied Mathematics 158, 123-135.
39
Brouwer, A.E., Post, G., Woeginger, G.J. (2008) Tight bounds for break minimization, Journal of Combinatorial Theory (A) 115, 1065-1068.
40
Buiteveld, B., van Holland, E., Post, G., Smit, D. (2014) Round-robin tournaments with homogenous rounds, Annals of Operations Research 218, 115-128.
41
Burke, E.K., Werra, D. de, Landa Silva, J.D., Raess, C. (2004) Applying heuristic methods to schedule sports competitions on multiple venues, Proceedings PATAT 2004, Pittsburgh, USA, 441-444.
42
Burrows, W., Tuffley, C. (2015) Maximising common fixtures in a round robin tournament with two divisions, arXiv:1502.06664
43
Cain, W.O. (1977) The computer-aided heuristic approach used to schedule the major league baseball clubs, in: S.P. Ladany and R.E. Machol (eds.), Optimal Strategies in Sports, North Holland, Amsterdam, 33-41.
44
Campbell, R.T., Chen, D.-S. (1976) A minimum distance basketball scheduling problem, in: R.E. Machol, S.P. Ladany and D.G. Morrison (eds.), Management Science in Sports, 15-25.
45
Carvalho, M.A.M. de, Loreno, L.A.N. (2012) New models for the mirrored traveling tournament problem, Computers & Industrial Engineering 63, 1089-1095.
46
Cheung, K.K.H. (2008) Solving mirrored traveling tournament problem benchmark instances with eight teams, Discrete Optimization 5, 138-143.
47
Cheung, K.K.H. (2009) A Benders approach for computing lower bounds for the mirrored traveling tournament problem, Discrete Optimization 6, 189-196.
48
Colbourn, C.J. (1983) Embedding partial Steiner triple systems is NP-complete, Journal of Combinatorial Theory (A) 35, 100-105.
49
Colbourn, C.J. (1984) The complexity of completing partial Latin squares, Discrete Applied Mathematics 8, 25-30.
50
Colbourn, C.J., Dinitz, J.H. (2006) Handbook of Combinatorial Designs, 2nd edition, CRC Press.
51
Corriveau, J. (1988) Enumeration of balanced tournament designs, Ars Combinatoria 25, 93-105.
52
Costa, D. (1995) An evolutionary tabu search algorithm and the NHL scheduling problem, INFOR 33, 161-178.
53
Costa, F.N., Urrutia, S., Ribeiro, C.C. (2012) An ILS heuristic for the traveling tournament problem with predefined venues, Annals of Operations Research 194, 137-150.
54
Cotta, C., Dotu, I., Fernandez, A.J., van Hentenryck, P. (2006) Scheduling social golfers with memetic evolutionary programming, Lecture Notes in Computer Science 4030, Springer, 150-161.
55
Craig, S., While, L, Barone, L. (2009) Scheduling for the National Hockey League using a multi-objective evolutionary algorithm, Lecture Notes in Artificial Intelligence 5866, Springer, 381-390.
56
Crauwels, H., Van Oudheusden, D. (2003) Ant colony optimization and local improvement, Workshop of Real-Life Applications of Metaheuristics, Antwerp, Belgium.
57
Dejonghe, T. (2004) Restructuring the Belgian professional football league: a location-allocation solution, Tijdschrift voor Economische en Sociale Geografie 95, 73-88.
58
Della Croce, F., Tadei, R., Asioli, P.S. (1999) Scheduling a round robin tennis tournament under courts and players availability constraints, Annals of Operations Research 92, 349-361.
59
Della Croce, F., Oliveri, D. (2006) Scheduling the Italian Football League: an ILP-based approach, Computers and Operations Research 33, 1963-1974.
60
Di Gaspero, L., Schaerf, A. (2007) A composite-neighborhood tabu search approach to the traveling tournament problem, Journal of Heuristics 13, 189-207.
61
Dinitz, J.H. (2004) Designing schedules for leagues and tournaments, Talk at Graph Theory Day 48, November 13, 2004.
62
Dinitz, J.H., Dinitz, M. (2005) Enumeration of balanced tournament designs on 10 points, Journal of Combinatorial Mathematics and Combinatorial Computing 52, 51-64.
63
Dinitz, J.H., Froncek, D. (2000) Scheduling the XFL, Congressus Numerantium 147, 5-15.
64
Dinitz, J.H., Froncek, D., Lamken, E.R., Wallis, W.D. (2006) Scheduling a tournament, in: C.J. Colbourn, J.H. Dinitz (eds.), Handbook of Combinatorial Designs, CRC Press, [50].
65
Dinitz, J.H., Ling, A.C.H. (2001) The existence of referee squares, Discrete Mathematics 232, 109-112.
66
Dinitz, J.H., Stinson, D.R. (2005) On assigning referees to tournament schedules, Bulletin of the Institute of Combinatorics and its Applications 44, 22-28.
67
Dotu, I., van Hentenryck, P. (2005) Scheduling social golfers locally, Lecture Notes in Computer Science 3524, Springer, 155-167.
68
Drexl, A., Knust, S. (2007) Sports league scheduling: graph- and resource-based models, Omega 35, 465-471.
69
Duarte, A.R., Ribeiro, C.C., Urrutia, S. (2007) A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy, Lecture Notes in Computer Science 4771, Springer, 82-95.
70
Duarte, A.R., Ribeiro, C.C., Urrutia, S., Haeusler, E.H. (2007) Referee assignment in sports leagues, Lecture Notes in Computer Science 3867, Springer, 158-173.
71
Duran, G., Noronha, T.F., Ribeiro, C.C., Souyris, S., Weintraub, A. (2006) Branch-and-cut for a real-life highly constrained soccer tournament scheduling problem, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 398-401.
72
Duran, G., Guajardo, M., Miranda, J., Saure, D., Souyris, S., Weintraub, A., Wolf, R. (2007) Scheduling the Chilean soccer league by integer programming, Interfaces 37, 539-552.
73
Duran, G., Guajardo, M., Weintraub, A., Wolf, R. (2009) OR & Soccer: Scheduling the Chilean league using mathematical programming, OR/MS Today 36, 42-47.
74
Duran, G., Guajardo, M., Wolf, R. (2012) Operations research techniques for scheduling Chile's second division soccer league, Interfaces 42, 273-285.
75
Easton, K. (2002) Using integer programming and constraint programming to solve sports scheduling problems, Ph.D. thesis, Georgia Institute of Technology, Atlanta.
76
Easton, K., Nemhauser, G., Trick, M. (2001) The travelling tournament problem: description and benchmarks, in: Proceedings CP'01, Lecture Notes in Computer Science 2239, Springer, 580-585.
77
Easton, K., Nemhauser, G., Trick, M. (2003) Solving the travelling tournament problem: a combined integer programming and constraint programming approach, in: E. Burke and P. De Causmaecker (eds.), PATAT 2002, Lecture Notes in Computer Science 2740, Springer, 100-109.
78
Easton, K., Nemhauser, G., Trick, M. (2004) Sports scheduling, in: J.T. Leung (ed.): Handbook of Scheduling, CRC Press, 52.1-52.19.
79
Easton, T., Parker, R.G. (2001) On completing latin squares, Discrete Applied Mathematics 113, 167-181.
80
Elf, M., Jünger, M., Rinaldi, G. (2003) Minimizing breaks by maximizing cuts, Operations Research Letters 31, 343-349.
81
Evans, J.R. (1988) A microcomputer-based decision support system for scheduling umpires in the American baseball league, Interfaces 18, 42-51.
82
Evans, J.R., Hebert, J.E., Deckro, R.F. (1984) Play ball: the scheduling of sports officials, Perspectives in Computing 4, 18-29.
83
Farmer, A., Smith, J.S., Miller, L.T. (2007) Scheduling umpire crews for professional tennis tournaments, Interfaces 37, 187-196.
84
Ferland, J.A., Fleurent, C. (1991) Computer aided scheduling for a sport league, INFOR 29, 14-25.
85
Fiallos, J., Perez, J., Sabillon, F., Licona, M. (2010) Scheduling soccer league of Honduras using integer programming, in: A. Johnson and J. Miller (eds.), Proceedings of the 2010 Industrial Engineering Research Conference, San Carlos, 2010.
86
Flatberg, T., Nilssen, E., Stlevik, M. (2009) Scheduling the topmost football leagues of Norway, Abstract 23rd EURO conference, Bonn, 240.
87
Finizio, N.J. (1993) Tournament designs balanced with respect to several bias categories, Bulletin of the Institute of Combinatorics and its Applications 9, 69-95.
88
Fleurent, C., Ferland, J.A. (1993) Allocating games for the NHL using integer programming, Operations Research 41, 649-654.
89
Franek, F., Froncek, D., Rosa, A. (2001) Imbalance in tournament designs, Australasian Journal of Combinatorics 23, 237-251.
90
Froncek, 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 (MISTA'03), Nottingham, UK, 331-340.
91
Froncek, D. (2001) Scheduling the Czech national basketball league, Congressus Numerantium 153, 5-24.
92
Fujiwara, N., Imahori, S., Matsui, T., Miyashiro, R. (2007) Constructive algorithms for the constant distance traveling tournament problem, Lecture Notes in Computer Science 3867, Springer, 135-146.
93
Geinoz, A., Ekim, T., de Werra, D. (2008) Construction of balanced sports schedules using partitions into subleagues, Operations Research Letters 36, 279-282.
94
Gelling, E.N., Odeh, R.E. (1974) On 1-factorizations of the complete graph and the relationship to round robin schedules, Congressus Numerantium 9, 213-221.
95
Goerigk, M., Westphal, S. (2014) A combined local search and integer programming approach to the traveling tournament problem, Annals of Operations Research.
96
Gomes, C.P., Selman, B., McAloon, K., Tretkoff, C. (1998) Randomization in backtrack search: exploiting heavy-tailed profiles for solving hard scheduling problems, in: Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS98), Pittsburgh, PA.
97
Goossens, D., Belien, J., Spieksma, F.C.R. (2012) Comparing league formats with respect to match importance in Belgian football, Annals of Operations Research 194, 223-240.
98
Goossens, D., Spieksma, F.C.R. (2009) Scheduling the Belgian soccer league, Interfaces 39, 109-118.
99
Goossens, D., Spieksma, F.C.R. (2011) Breaks, cuts, and patterns, Operations Research Letters 39, 428-432.
100
Goossens, D., Spieksma, F.C.R. (2012) Soccer schedules in Europe: an overview, Journal of Scheduling 15, 641-651.
101
Grabau, K. (2012) Softball scheduling as easy as 1-2-3 (strikes you're out) Interfaces 42, 310-319.
102
Griggs, T.S., Rosa, A. (1996) A tour of European soccer schedules, or testing the popularity of $GK_{2n}$, Bulletin of the Institute of Combinatorics and its Applications 18, 65-68.
103
Gschwind, T., Irnich, S. (2011) A note on symmetry reduction for circular traveling tournament problems, European Journal of Operational Research 210, 452-456.
104
Guedes, A., Ribeiro, C.C. (2009) A hybrid heuristic for minimizing weighted carry-over effects in round robin tournaments, in: Proceedings of the 4th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'09), Dublin.
105
Guedes, A., Ribeiro, C.C. (2011) A heuristic for minimizing weighted carry-over effects in round robin tournaments, Journal of Scheduling 14, 655-667.
106
Gusfield, D., Martel, C. (2002) The structure and complexity of sports elimination numbers, Algorithmica 32, 73-86.
107
Hamiez, J.-P., Hao, J.-K. (2001) Solving the sports league scheduling problem with tabu search, in: A.Nareyek (ed.): Local Search for Planning and Scheduling, Lecture Notes in Artificial Intelligence 2148, Springer, 24-36.
108
Hamiez, J.-P., Hao, J.-K. (2004) A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib), Discrete Applied Mathematics 143, 252-265.
109
Hamiez, J.-P., Hao, J.-K. (2008) Using solution properties within an enumerative search to solve a sports league scheduling problem, Discrete Applied Mathematics 156, 1683-1693.
110
Hamiez, J.-P., Hao, J.-K. (2006) Sports league scheduling: enumerative search for prob026 from CSPLib, in: F.Benhamou (ed.): CP 2006, Lecture Notes in Computer Science 4204, Springer, 716-720.
111
Haselgrove, J., Leech, J. (1977) A tournament design problem, American Mathematical Monthly 84, 198-201.
112
Hausken, M., Andersson, K., Fagerholt, K., Flatberg, T. (2013) Scheduling the Norwegian football league, International Transactions in Operational Research 20, 59-77.
113
Henz, M. (1999) Constraint-based round robin tournament planning, in: D. De Schreye (ed.), Proceedings of the International Conference on Logic Programming, Las Cruces, New Mexico, MIT Press, 545-557.
114
Henz, M. (2000) Friar Tuck - A constraint-based tournament-scheduling tool, IEEE Intelligent Systems, 15, 5-7.
115
Henz, M. (2001) Scheduling a major college basketball conference-revisited, Operations Research 49, 163-168.
116
Henz, M. (2004) Playing with constraint programming and large neighborhood search for traveling tournaments, Proceedings PATAT 2004, Pittsburgh, USA.
117
Henz, M., Müller, T., Tan, T., Thiel, S. (2000) The pairing constraint for round robin tournament scheduling, Preprint, School of Computing at the National University of Singapore.
118
Henz, M., Müller, T., Thiel, S. (2004) Global constraints for round robin tournament scheduling, European Journal of Operational Research 153, 92-101.
119
Horbach, A. (2010) A combinatorial property of the maximum round robin tournament problem, Operations Research Letters 38, 121-122.
120
Horbach, A., Bartsch, T., Briskorn, D. (2012) Using a SAT-solver to schedule sports leagues, Journal of Scheduling 15, 117-125.
121
Horton, J.D. (1989) Hamilton path tournament designs, Ars Combinatoria 27, 69-74.
122
Hoshino, R., Kawarabayashi, K. (2011) The inter-league extension of the traveling tournament application to sports scheduling, 25th AAAI Conference on Artificial Intelligence, San Francisco, USA.
123
Hoshino, R., Kawarabayashi, K. (2011) The distance-optimal inter-league schedule for Japanese Pro Baseball, ICAPS 2011 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS), Freiburg, Germany.
124
Hoshino, R., Kawarabayashi, K. (2011) The multi-round balanced traveling tournament problem, Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS).
125
Hoshino, R., Kawarabayashi, K. (2011) A multi-round generalization of the traveling tournament problem and its application to Japanese baseball, European Journal of Operational Research 215, 481-497.
126
Huang, H.-D., Yang, J.T., Shen, S., Horng, J.-T. (1999) An evolutionary strategy to solve sports scheduling problems, in: W. Banzhaf et al. (eds.), Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, Los Altos, CA.
127
Hwang, F.K. (1989) How to design round-robin schedules, in: D.Z. Du, H. Guoding (eds.), Combinatorics, Computing and Complexity, Math. Appl. (Chinese series) 1, Kluwer, 142-160.
128
Ikebe, Y.T., Tamura, A. (2008) On the existence of sports schedules with multiple venues, Discrete Applied Mathematics 156, 1694-1710.
129
Imahori, S., Matsui, T., Miyashiro, R. (2014) An approximation algorithm for the unconstrained traveling tournament problem, Annals of Operations Research 218, 237-247.
130
Irnich, S. (2010) A new branch-and-price algorithm for the traveling tournament problem, European Journal of Operational Research 204, 218-228.
131
Keedwell, A.D. (2000) Construction, properties and application of finite neofields, Comment. Math. Univ. Carolinae 41, 283-297.
132
Kendall, G. (2008) Scheduling English football fixtures over holiday periods, Journal of the Operational Research Society 59, 743-755.
133
Kendall, G., Knust, S., Ribeiro, C.C., Urrutia, S. (2010) Scheduling in sports: An annotated bibliography, Computers and Operations Research 37, 1-19.
134
Kendall, G., Miserez, W., Vanden Berghe, G. (2006) A constructive heuristic for the traveling tournament problem, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 443-447.
135
Kendall, G., McCollum, B., Cruz, F., McMullan, P. (2010) Scheduling English football fixtures: consideration of two conflicting objectives, Proceedings PATAT 2010, Belfast, Northern Ireland, 1-15.
136
Kern, W., Paulusma, D. (2001) The new FIFA rules are hard complexity aspects of sports competitions, Discrete Applied Mathematics 108, 317-323.
137
Kern, W., Paulusma, D. (2004) The computational complexity of the elimination problem in generalized sports competitions, Discrete Optimization 1, 205-214.
138
Khelifa, M., Boughaci, D. (2015) A variable neighborhood search method for solving the traveling tournaments problem, Electronic Notes in Discrete Mathematics 47, 157-164.
139
Kirkman, T.P. (1847) On a problem in combinations, Cambridge and Dublin Mathematics Journal 2,191-204.
140
Knust, S. (2008) Scheduling sports tournaments on a single court minimizing waiting times, Operations Research Letters 36, 471-476.
141
Knust, S. (2010) Scheduling non-professional table-tennis leagues, European Journal of Operational Research 200, 358-367.
142
Knust, S., Lücking, D. (2009) Minimizing costs in round robin tournaments with place constraints, Computers and Operations Research 36, 2937-2943.
143
Knust, S., Thaden, M. von (2006) Balanced home-away assignments, Dicrete Optimization 3, 354-365.
144
Kostuk, K.J. (1997) A decision support system for a large, multi-event tournament, INFOR 35, 183-195.
145
Kostuk, K.J., Willoughby, K.A. (2012) A decision support system for scheduling the Canadian football league, Interfaces 42, 286-295.
146
Kujansuu, E., Lindberg, T., Mäkinen, E. (1999) The stable roommates problem and chess tournament pairings, Divulgaciones Matematicas 7, 19-28.
147
Kyngäs, J., Nurmi, K., Kyngäs, N., Lilley, G., Salter, T. (2014) Scheduling the Australian Football League, Proc. 10th Conference on the Practice and Theory of Automated Timetabling (PATAT), York, UK, 309-317.
148
Lamken, E.R. (1990) Generalized balanced tournament designs, Transactions of the American Mathematical Society 318, 473-490.
149
Lamken, E.R. (1996) A few more partitioned balanced tournament designs, Ars Combinatoria 43, 121-134.
150
Lamken, E.R. (1997) The existence of partitioned generalized balanced tournament designs with block size 3, Designs, Codes and Cryptography 11, 37-71.
151
Lamken, E.R., Vanstone, S.A. (1985) The existence of factored balanced tournament designs, Ars Combinatoria 19, 157-160.
152
Lamken, E.R., Vanstone, S.A. (1987) The existence of partitioned balanced tournament designs, Annals of Discrete Mathematics 34, 339-352.
153
Lamken, E.R., Vanstone, S.A. (1988) Orthogonal resolutions in odd balanced tournament designs, Graphs and Combinatorics 4, 241-255.
154
Lamken, E.R., Vanstone, S.A. (1989) Balanced tournament designs and related topics, Discrete Mathematics 77, 159-176.
155
Lee, J.H., Lee, Y.H., Lee, Y.H. (2006) Mathematical modeling and tabu search heuristic for the traveling tournament problem, in: M.Gavrilova et al. (eds.): ICCSA 2006, Lecture Notes in Computer Science 3982, Springer, 875-884.
156
Lewis, R., Thompson. J. (2011) On the application of graph colouring techniques in round-robin sports scheduling, Computers & Operations Research 38, 190-204.
157
Lim, A., Zhang, X. (2003) Integer programming and simulated annealing for scheduling sports competition on multiple venues, Proceedings MIC 2003.
158
Lim, A., Rodrigues, B., Zhang, X. (2006) A simulated annealing and hill-climbing algorithm for the traveling tournament problem, European Journal of Operational Research 174, 1459-1478.
159
Lim, A., Rodrigues, B., Zhang, X. (2006) Scheduling sports competitions at multiple venues - revisited, European Journal of Operational Research 175, 171-186.
160
McAloon, K., Tretkoff, C., Wetzel, G. (1997) Sports league scheduling, in: Proceedings of the 3rd ILOG Optimization Suite International Users Conference, Paris.
161
Melo, R.A., Urrutia, S., Ribeiro, C.C. (2007) Scheduling single round robin tournaments with fixed venues, in: Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'07), 431-438, Paris.
162
Melo, R.A., Urrutia, S., Ribeiro, C.C. (2009) The traveling tournament problem with predefined venues, Journal of Scheduling 12, 607-622.
163
Mendelsohn, E., Rosa, A. (1985) One-factorizations of the complete graph - a survey, Journal of Graph Theory 9, 43-65.
164
Mendelsohn, E., Rodney, P. (1994) The existence of court balanced tournament designs, Discrete Mathematics 133, 207-216.
165
Mitchell, J.E. (2000) Realignment in the national football league, Working Paper, Mathematical Sciences, Rensselaer Polytechnic Institute Troy, NY 12180.
166
Miyashiro, R., Iwasaki, H., Matsui, T. (2003) Characterizing feasible pattern sets with a minimum number of breaks, in: E. Burke and P. De Causmaecker (eds.), PATAT 2002, Lecture Notes in Computer Science 2740, Springer, 78-99.
167
Miyashiro, R., Matsui, T. (2005) A polynomial-time algorithm to find an equitable home-away assignment, Operations Research Letters 33, 235-241.
168
Miyashiro, R., Matsui, T. (2006) Semidefinite programming based approaches to the break minimization problem, Computers and Operations Research 33, 1975-1982.
169
Miyashiro, R., Matsui, T. (2006) Minimizing the carry-over effects value in a round-robin tournament, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 402-405.
170
Miyashiro, R., Imahori, S., Matsui, T. (2012) An approximation algorithm for the traveling tournament problem, Annals of Operations Research 194, 317-324.
171
Nemhauser, G.L., Trick, M.A. (1998) Scheduling a major college basketball conference, Operations Research 46, 1-8.
172
Noronha, T.F., Ribeiro, C.C., Duran, G., Souyris, S., Weintraub, A. (2007) A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament, Lecture Notes in Computer Science 3867, Springer, 174-186.
173
Nowak, M., Epelman, M., Pollock, S.M. (2006) Assignment of swimmers to dual meet events, Computers and Operations Research 33, 1951-1962.
174
Nurmi, K., Goossens, D., Bartsch, T., Bonomo, F., Briskorn, D., Duran, G, Kyngäs, J., Marenco, J., Ribeiro, C., Spieksma, F.., Urrutia, S., Wolf, R. (2010) A framework for a highly constrained sports scheduling problem, Proceedings of the International Multi-Conference of Engineers and Computer Scientists, Volume III, Hong-Kong, 1991-1997
also
IAENG Transactions on Engineering Technologies, American Institute of Physics 5, 14-28.
175
Nurmi, K., Kyngäs, J., Goossens, D. (2011) Scheduling a triple round robin tournament for the Finnish national ice hockey league for players under 20, IEEE SSCI 2011 - CISched 2011: 2011 IEEE Symposium on Computational Intelligence in Scheduling, 46-53.
176
Nurmi, K., Kyngäs, J., Goossens, D. (2013) Scheduling a triple round robin tournament with minitournaments for the Finnish national youth ice hockey league, Journal of the Operational Research Society 65, 1770-1779.
177
Nurmi, K., Kyngäs, J., Goossens, D., Kyngäs, N. (2014) Scheduling a professional sports league using the PEAST algorithm, Lecture Notes in Engineering and Computer Science: International MultiConference of Engineers and Computer Scientists, Hong Kong, 1176-1182.
178
Oliveira, L. de, Souza, C.C. de, Yunes, T. (2014) Improved bounds for the traveling umpire problem: A stronger formulation and a relax-and-fix heuristic, European Journal of Operational Research 236, 592-600.
179
Panton, D., Bryant, K., Schreuder, J. (2002) Optimisation tools for round-robin and partial round-robin sporting fixtures, Abstracts from the 6th Australian Conference on Mathematics & Computers in Sport, Bond University, Queensland, Australia.
180
Perron, L. (2005) Alternate modelling in sport scheduling, in: P. van Beek (ed.), CP 2005, Lecture Notes in Computer Science 3709, Springer, 797-801.
181
Post, G., Woeginger, G.J. (2006) Sports tournaments, home-away assignments, and the break minimization problem, Discrete Optimization 3, 165-173.
182
Rasmussen, R.V. (2008) Scheduling a triple round robin tournament for the best Danish soccer league, European Journal of Operational Research 185, 795-810.
183
Rasmussen, R.V., Trick, M.A. (2008) Round robin scheduling - a survey, European Journal of Operational Research 188, 617-636.
184
Rasmussen, R.V., Trick, M.A. (2007) A Benders approach for the constrained minimum break problem, European Journal of Operational Research 177, 198-213.
185
Rasmussen, R.V., Trick, M.A. (2009) The timetable constrained distance minimization problem, Annals of Operations Research 171, 45-59.
186
Recalde, D., Torres, R., Vaca, P. (2013) Scheduling the professional Ecuadorian football league by integer programming, Computers & Operations Research 40, 2478-2484.
187
Regin, J.-C. (2001) Minimization of the number of breaks in sports scheduling problems using constraint programming, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 57, 115-130.
188
Ribeiro, C.C. (2012) Sports scheduling: problems and applications, International Transactions in Operational Research 19, 201-226.
189
Ribeiro, C.C., Urrutia, S. (2005) An application of integer programming to playoff elimination in football championships, International Transactions in Operational Research 12, 375-386.
190
Ribeiro, C.C., Urrutia, S. (2004) OR on the ball: applications in sports scheduling and management, OR/MS Today 31, 50-54.
191
Ribeiro, C.C., Urrutia, S. (2006) Scheduling the Brazilian soccer championship, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 481-483.
192
Ribeiro, C.C., Urrutia, S. (2007) Scheduling the Brazilian soccer tournament with fairness and broadcast objectives, Lecture Notes in Computer Science 3867, Springer, 149-159.
193
Ribeiro, C.C., Urrutia, S. (2007) Heuristics for the mirrored traveling tournament problem, European Journal of Operational Research 179, 775-787.
194
Ribeiro, C.C., Urrutia, S. (2012) Scheduling the Brazilian soccer tournament: solution approach and practice, Interfaces 42, 260-272.
195
Robinson, L.W. (1991) Baseball playoff elimination: an application of linear programming, Operations Research Letters 10, 67-74.
196
Rodney, P. (1995) The existence of interval-balanced tournament designs, Journal of Combinatorial Mathematics and Combinatorial Computing 19, 161-170.
197
Rosa, A., Wallis, W. (1982) Premature sets of 1-factors or how not to schedule round robin tournaments, Discrete Applied Mathematics 4, 217-226.
198
Russell, K.G. (1980) Balancing carry-over effects in round robin tournaments, Biometrika 67, 127-131.
199
Russell, R.A., Leung, J.M. (1994) Devising a cost effective schedule for a baseball league, Operations Research 42, 614-625.
200
Russell, R.A., Urban, T.L. (2006) A constraint programming approach to the multiple-venue sport-scheduling problem, Computers and Operations Research 33, 1895-1906.
201
Russell, T., van Beek, P. (2012) A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems, European Journal of Operational Research 218, 819-828.
202
Sakaguchi, T., Ishizaki, S. (2005) A neural network model for sports scheduling problems with considering travel cost, Transactions of Information Processing Society of Japan 46, 103-110.
203
Saur, M.C., Starr, K., Husted, M., Newman, A.M. (2012) Scheduling softball series in the Rocky Mountain athletic conference, Interfaces 42, 296-309.
204
Schaerf, A. (1999) Scheduling sport tournaments using constraint logic programming, Constraints 4, 43-65.
205
Schellenberg, P.J., van Rees, G.H.J., Vanstone, S.A. (1977) The existence of balanced tournament designs, Ars Combinatoria 3, 303-318.
206
Schönberger, J., Mattfeld, D.C., Kopfer, H. (2000) Automated timetable generation for rounds of a table-tennis league, Proceedings of the 2000 Congress on Evolutionary Computation, 277-284.
207
Schönberger, J., Mattfeld, D.C., Kopfer, H. (2004) Memetic algorithm timetabling for non-commercial sport leagues, European Journal of Operational Research 153, 102-116.
208
Schreuder, J.A.M. (1980) Constructing timetables for sport competitions, Mathematical Programming Study 13, 58-67.
209
Schreuder, J.A.M. (1992) Combinatorial aspects of construction of competition dutch professional football leagues, Discrete Applied Mathematics 35, 301-312.
210
Schreuder, J.A.M. (1993) Construction of fixture lists for professional football leagues, Ph.D. thesis, University of Strathclyde, Glasgow.
211
Straley, T.H. (1983) Scheduling designs for a league tournament, Ars Combinatoria 15, 193-200.
212
Su, L.-H., Chiu, Y., Cheng, T.C.E. (2013) Sports tournament scheduling to determine the required number of venues subject to the minimum timeslots under given formats, Computers & Industrial Engineering 65, 226-232.
213
Suzuka, A., Miyashiro, R., Yoshise, A., Matsui, T. (2005) Semidefinite programming based approaches to home-away assignment problems in sports scheduling, The First International Conference on Algorithmic Applications in Management (AAIM 2005), Lecture Notes in Computer Science 3521, Springer, 95-103.
214
Suzuka, A., Miyashiro, R., Yoshise, A., Matsui, T. (2006) Dependent randomized rounding to the home-away assignment problem in sports scheduling, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E89-A, 1407-1416.
215
Suzuka, A., Miyashiro, R., Yoshise, A., Matsui, T. (2007) The home-away assignment problems and break minimization/maximization problems in sports scheduling, Pacific Journal of Optimization 3, 113-133.
216
Suzuka, A., Saruwatari, Y., Yoshise, A. (2002) Solving sports scheduling problems using network structure, Proceedings PATAT 2002, KaHo Sint-Lieven, Gent, Belgium.
217
Tajbakhsh, A., Eshghi, K., Shamsi, A. (2012) A hybrid PSO-SA algorithm for the travelling tournament problem, European Journal of Industrial Engineering 6, 2-25.
218
Thielen, C., Westphal, S. (2011) Complexity of the traveling tournament problem, Theoretical Computer Science 412, 345-351.
219
Thielen, C., Westphal, S. (2012) Approximation algorithm for TTP(2), Mathematical Methods of Operations Research 76, 1-20.
220
Trick, M.A. (2001) A schedule-then-break approach to sports timetabling, in: E. Burke and W. Erben (eds.), PATAT 2000, Lecture Notes in Computer Science 2079, Springer, 242-252.
221
Trick, M.A. (2003) Integer and constraint programming approaches for round-robin tournament scheduling, in: E. Burke and P. De Causmaecker (eds.), PATAT 2002, Lecture Notes in Computer Science 2740, Springer, 63-77.
222
Trick, M.A. (2004) Using sports scheduling to teach integer programming, INFORMS Transactions on Education 5, 10-17.
223
Trick, M.A., Yildiz, H. (2007) Bender's cuts guided large neighborhood search for the traveling umpire problem, Lecture Notes in Computer Science 4510, 332-345.
224
Trick, M.A., Yildiz, H. (2011) Benders' cuts guided large neighborhood search for the traveling umpire problem, Naval Research Logistics 58, 771-781.
225
Trick, M.A., Yildiz, H. (2012) Locally optimized crossover for the traveling umpire problem, European Journal of Operational Research 216, 286-292.
226
Trick, M.A., Yildiz, H., Yunes, T. (2012) Scheduling major league baseball umpires and the traveling umpire problem, Interfaces 42, 232-244.
227
Triska, M., Musliu, N. (2012) An effective greedy heuristic for the social golfer problem, Annals of Operations Research 194, 413-425.
228
Triska, M., Musliu, N. (2012) An improved SAT formulation for the social golfer problem, Annals of Operations Research 194, 427-438.
229
Urban, T.L., Russell, R.A. (2003) Scheduling sports competitions on multiple venues, European Journal of Operational Research 148, 302-311.
230
Urrutia, S., Ribeiro, C.C. (2006) Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Discrete Applied Mathematics 154, 1932-1938.
231
Urrutia, S., Ribeiro, C.C., Melo, R.A. (2007) A new lower bound to the traveling tournament problem, in: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2007), Honolulu, 15-18.
232
Uthus, D.C., Riddle, P.J., Guesgen, H.W. (2008) Ant colony optimization and the single round robin maximum value problem, Lecture Notes in Computer Science 5217, ANTS 2008, Springer, 243-250.
233
Uthus, D.C., Riddle, P.J., Guesgen, H.W. (2009) An ant colony optimization approach to the traveling tournament problem, Proceedings GECCO 2009, Montreal.
234
Uthus, D.C., Riddle, P.J., Guesgen, H.W. (2009) DFS* and the traveling tournament problem, Lecture Notes in Computer Science 5547, CPAIOR 2009, Springer, 279-293.
235
Uthus, D.C., Riddle, P.J., Guesgen, H.W. (2012) Solving the traveling tournament problem with iterative-deepening A$^\star$, Journal of Scheduling 15, 601-614.
236
Van Voorhis, T.V. (2002) Highly constrained college basketball scheduling, Journal of the Operational Research Society 53, 603-609.
237
Van Voorhis, T.V. (2005) College basketball scheduling with travel swings, Computers & Industrial Engineering 48, 163-172.
238
van't Hof, P., Post, G., Briskorn, D. (2010) Constructing fair round robin tournaments with a minimum number of breaks, Operations Research Letters 38, 592-596.
239
Wallis, W.D. (1983) A tournament problem, Journal of the Mathematical Society, Series B 24, 289-291.
240
Walser, J.P. (1999) Integer optimization by local search - a domain-independent approach, Lecture Notes in Artificial Intelligence 1637, Springer, Berlin-Heidelberg.
241
Wauters, T., Van Malderen, S., Vanden Berghe, G. (2014) Decomposition and local search based methods for the traveling umpire problem, European Journal of Operational Research 238, 886-898.
242
Weert, A. van, Schreuder, J.A.M. (1998) Construction of basic match schedules for sports competitions by using graph theory, in: E. Burke and M. Carter (eds.), PATAT 1997, Lecture Notes in Computer Science 1408, Springer, 201-210.
243
Werners, B., Wülfing, T. (2007) Optimierung von Spielplänen am Beispiel der Fussball-Bundesliga-Saison 2006/07, Zeitschrift für Planung & Unternehmenssteuerung 18, 207-221.
244
Werra, D. de (1980) Geography, games, and graphs, Discrete Applied Mathematics 2, 327-337.
245
Werra, D. de (1981) Scheduling in sports, in: P. Hansen (ed.), Studies on Graphs and Discrete Programming, 381-395.
246
Werra, D. de (1982) Minimizing irregularities in sports schedules using graph theory, Discrete Applied Mathematics 4, 217-226.
247
Werra, D. de (1985) On the multiplication of divisions: the use of graphs for sports scheduling, Networks 15, 125-136.
248
Werra, D. de (1988) Some models of graphs for scheduling sports competitions, Discrete Applied Mathematics 21, 47-65.
249
Werra, D. de, Descombes, J.L., Masson, P. (1990) A constrained sports scheduling problem, Discrete Applied Mathematics 26, 41-49.
250
Werra, D. de, Ekim, T., Raess, C. (2006) Construction of sports schedules with multiple venues, Discrete Applied Mathematics 154, 47-58.
251
Westphal, S. (2014) Scheduling the German basketball league. Interfaces, 44, 498-508.
252
Westphal, S., Noparlik, K. (2014) A 5.875-approximation for the traveling tournament problem, Annals of Operations Research 218, 347-360.
253
Willis, R.J., Terrill, B.J. (1994) Scheduling the Australian state cricket season using simulated annealing, Journal of the Operational Research Society 45, 276-280.
254
Wright, M. (1991) Scheduling English cricket umpires, Journal of the Operational Research Society 42, 447-452.
255
Wright, M. (1992) A fair allocation of county cricket opponents, Journal of the Operational Research Society 43, 195-201.
256
Wright, M. (1994) Timetabling county cricket fixtures using a form of tabu search, Journal of the Operational Research Society 45, 758-770.
257
Wright, M. (2005) Scheduling fixtures for New Zealand cricket, IMA Journal of Management Mathematics 16, 99-112.
258
Wright, M. (2006) Scheduling fixtures for basketball New Zealand, Computers and Operations Research 33, 1875-1893.
259
Wright, M. (2009) 50 years of OR in sport, Journal of the Operational Research Society 60, 161-168.
260
Xue, L., Luo, Z., Lim, A. (2015) Two exact algorithms for the traveling umpire problem, European Journal of Operational Research 243, 932-943.
261
Yang, J.T., Huang, H.-D., Yang, J., Horng, J.-T. (1999) Devising a cost effective baseball scheduling by evolutionary algorithms, Working Paper, Department of Computer Science and Information Engineering, National Central University, Chungli 32054, Taiwan.
262
Yamaguchi, D., Imahori, S., Miyashiro, R., Matsui, T. (2009) An improved approximation algorithm for the traveling tournament problem, Lecture Notes in Computer Science 5878, Springer, 679-688.
263
Yamaguchi, D., Imahori, S., Miyashiro, R., Matsui, T. (2011) An improved approximation algorithm for the traveling tournament problem, Algorithmica 61, 1077-1091.
264
Yavuz, M., Inan, U.H., Figlali, A. (2008) Fair referee assignments for professional football leagues, Computers and Operations Research 35, 2937-2951.
265
Zeng, L., Mizuno, S. (2012) On the separation in 2-period double round robin tournaments with minimum breaks, Computers and Operations Research 39, 1692-1700.
266
Zeng, L., Mizuno, S. (2013) Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks, Operations Research Letters 41, 506-510.

Sigrid Knust 2015-04-24
http://www2.informatik.uni-osnabrueck.de/knust/sportssched/sportlit_class/node1.html