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
Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y. (2003) A simulated annealing approach to the traveling tournament problem, Proceedings CPAIOR'03, Montreal.

5
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.

6
Anderson, I. (1997) Combinatorial Designs and Tournaments, Oxford Lecture Series in Mathematics and Its Applications.

7
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.

8
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.

9
Anderson, I., Ferguson, C. (2004) Training schedules balanced for carryover effects, Bulletin of the Institute of Combinatorics and its Applications 40, 5-12.

10
Andreu, R., Corominas, A. (1989) SUCCESS92: a DSS for scheduling the olympic games, Interfaces 19, 1-12.

11
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.

12
Armstrong, J., Willis, R.J. (1993) Scheduling the cricket World Cup - a case-study, Journal of the Operational Research Society 44, 1067-1072.

13
Ball, B.C., Webster, D.B. (1977) Optimal scheduling for even-numbered team athletic conferences, AIIE Transactions 9, 161-169.

14
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.

15
Bartsch, T. (2001) Sportligaplanung - Ein Decision Support System zur Spielplanerstellung (in German), Deutscher Universitätsverlag, Wiesbaden.

16
Bartsch, T., Drexl, A. (2001) Fussball und Operations Research - Attraktive Spielpläne aus dem Computer (in German), OR News 13, 10-14.

17
Bartsch, T., Drexl, A. (2006) Fussballbundesliga-Spielpläne aus dem Computer (in German), OR News Sonderausgabe, 125-129.

18
Bartsch, T., Drexl, A., Kröger, S. (2006) Scheduling the professional soccer leagues of Austria and Germany, Computers and Operations Research 33, 1907-1937.

19
Bean, J.C., Birge, J.R. (1980) Reducing travelling costs and player fatigue in the national basketball association, Interfaces 10, 98-102.

20
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.

21
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.

22
Bernholt, T., Gülich, A. (2000) Anwendung von Komplexitätstheorie und effizienten Algorithmen auf die Fussballbundesliga (in German), Diplomarbeit, Universität Dortmund.

23
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.

24
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.

25
Blest, D.C., Fitzgerald, D.G. (1988) Scheduling sports competitions with a given distribution of times, Discrete Applied Mathematics 22, 9-19.

26
Briskorn, D. (2006) Scheduling sport leagues using branch-and-price, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 367-369.

27
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.

28
Briskorn, D. (2008) Feasibility of home-away-pattern sets for round robin tournaments, Operations Research Letters 36, 283-284.

29
Briskorn, D. (2009) Combinatorial properties of strength groups in round robin tournaments, European Journal of Operational Research 192, 744-754.

30
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.

31
Briskorn, D., Drexl, A. (2009) A branch-and-price algorithm for scheduling sport leagues, Journal of the Operational Research Society 60, 84-93.

32
Briskorn, D., Drexl, A. (2009) IP models for round robin tournaments, Computers and Operations Research 36, 837-852.

33
Briskorn, D., Drexl, A. (2009) A branching scheme for finding cost-minimal round robin tournaments, European Journal of Operational Research 197, 68-76.

34
Briskorn, D., Drexl, A., Spieksma, F.C.R. (2006) Round tobin tournaments and three index assignment, Report 604, Institut für Betriebswirtschaftslehre, Universität Kiel.

35
Briskorn, D., Horbach, A. (2009) A Lagrangian approach for minimum cost tournaments, Report 647, Institut für Betriebswirtschaftslehre, Universität Kiel.

36
Briskorn, D., Knust, S. (2010) Constructing fair sports league schedules with regard to strength groups, Discrete Applied Mathematics 158, 123-135.

37
Brouwer, A.E., Post, G., Woeginger, G.J. (2008) Tight bounds for break minimization, Journal of Combinatorial Theory (A) 115, 1065-1068.

38
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.

39
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.

40
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.

41
Cheung, K.K.H. (2008) Solving mirrored traveling tournament problem benchmark instances with eight teams, Discrete Optimization 5, 138-143.

42
Cheung, K.K.H. (2009) A Benders approach for computing lower bounds for the mirrored traveling tournament problem, Discrete Optimization 6, 189-196.

43
Colbourn, C.J. (1983) Embedding partial Steiner triple systems is NP-complete, Journal of Combinatorial Theory (A) 35, 100-105.

44
Colbourn, C.J. (1984) The complexity of completing partial Latin squares, Discrete Applied Mathematics 8, 25-30.

45
Colbourn, C.J., Dinitz, J.H. (2006) Handbook of Combinatorial Designs, 2nd edition, CRC Press.

46
Corriveau, J. (1988) Enumeration of balanced tournament designs, Ars Combinatoria 25, 93-105.

47
Costa, D. (1995) An evolutionary tabu search algorithm and the NHL scheduling problem, INFOR 33, 161-178.

48
Costa, F.N., Urrutia, S., Ribeiro, C.C. (2008) An ILS heuristic for the traveling tournament problem with fixed venues, in: E. Burke, M. Gendreau (eds.), PATAT 2008, Montreal, Proceedings.

49
Crauwels, H., Van Oudheusden, D. (2003) Ant colony optimization and local improvement, Workshop of Real-Life Applications of Metaheuristics, Antwerp, Belgium.

50
Dejonghe, T. (2004) Restructuring the Belgian professional football league: a location-allocation solution, Tijdschrift voor Economische en Sociale Geografie 95, 73-88.

51
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.

52
Della Croce, F., Oliveri, D. (2006) Scheduling the Italian Football League: an ILP-based approach, Computers and Operations Research 33, 1963-1974.

53
Di Gaspero, L., Schaerf, A. (2007) A composite-neighborhood tabu search approach to the traveling tournament problem, Journal of Heuristics 13, 189-207.

54
Dinitz, J.H. (2004) Designing schedules for leagues and tournaments, Talk at Graph Theory Day 48, November 13, 2004.

55
Dinitz, J.H., Dinitz, M. (2005) Enumeration of balanced tournament designs on 10 points, Journal of Combinatorial Mathematics and Combinatorial Computing 52, 51-64.

56
Dinitz, J.H., Froncek, D. (2000) Scheduling the XFL, Congressus Numerantium 147, 5-15.

57
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, [45].

58
Dinitz, J.H., Ling, A.C.H. (2001) The existence of referee squares, Discrete Mathematics 232, 109-112.

59
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.

60
Drexl, A., Knust, S. (2007) Sports league scheduling: graph- and resource-based models, Omega 35, 465-471.

61
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.

62
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.

63
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.

64
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.

65
Duran, G., Guajardo, M., Weintraub, A., Wolf, R. (2009) OR & Soccer: Scheduling the Chilean league using mathematical programming, OR/MS Today 36, 42-47.

66
Easton, K. (2002) Using integer programming and constraint programming to solve sports scheduling problems, Ph.D. thesis, Georgia Institute of Technology, Atlanta.

67
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.

68
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.

69
Easton, K., Nemhauser, G., Trick, M. (2004) Sports scheduling, in: J.T. Leung (ed.): Handbook of Scheduling, CRC Press, 52.1-52.19.

70
Easton, T., Parker, R.G. (2001) On completing latin squares, Discrete Applied Mathematics 113, 167-181.

71
Elf, M., Jünger, M., Rinaldi, G. (2003) Minimizing breaks by maximizing cuts, Operations Research Letters 31, 343-349.

72
Evans, J.R. (1988) A microcomputer-based decision support system for scheduling umpires in the American baseball league, Interfaces 18, 42-51.

73
Evans, J.R., Hebert, J.E., Deckro, R.F. (1984) Play ball: the scheduling of sports officials, Perspectives in Computing 4, 18-29.

74
Farmer, A., Smith, J.S., Miller, L.T. (2007) Scheduling umpire crews for professional tennis tournaments, Interfaces 37, 187-196.

75
Ferland, J.A., Fleurent, C. (1991) Computer aided scheduling for a sport league, INFOR 29, 14-25.

76
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.

77
Fleurent, C., Ferland, J.A. (1993) Allocating games for the NHL using integer programming, Operations Research 41, 649-654.

78
Franek, F., Froncek, D., Rosa, A. (2001) Imbalance in tournament designs, Australasian Journal of Combinatorics 23, 237-251.

79
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.

80
Froncek, D. (2001) Scheduling the Czech national basketball league, Congressus Numerantium 153, 5-24.

81
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.

82
Geinoz, A., Ekim, T., de Werra, D. (2008) Construction of balanced sports schedules using partitions into subleagues, Operations Research Letters 36, 279-282.

83
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.

84
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.

85
Goossens, D., Spieksma, F.C.R. (2006) Scheduling the Belgian soccer league, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 420-422.

86
Goossens, D., Spieksma, F.C.R. (2009) Scheduling the Belgian soccer league, Interfaces 39, 109-118.

87
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.

88
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.

89
Gusfield, D., Martel, C. (2002) The structure and complexity of sports elimination numbers, Algorithmica 32, 73-86.

90
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.

91
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.

92
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.

93
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.

94
Haselgrove, J., Leech, J. (1977) A tournament design problem, American Mathematical Monthly 84, 198-201.

95
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.

96
Henz, M. (2000) Friar Tuck - A constraint-based tournament-scheduling tool, IEEE Intelligent Systems, 15, 5-7.

97
Henz, M. (2001) Scheduling a major college basketball conference-revisited, Operations Research 49, 163-168.

98
Henz, M. (2004) Playing with constraint programming and large neighborhood search for traveling tournaments, Proceedings PATAT 2004, Pittsburgh, USA.

99
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.

100
Henz, M., Müller, T., Thiel, S. (2004) Global constraints for round robin tournament scheduling, European Journal of Operational Research 153, 92-101.

101
Horbach, A. (2010) A combinatorial property of the maximum round robin tournament problem, Operations Research Letters 38, 121-122.

102
Horbach, A., Bartsch, T., Briskorn, D. (2009) Optimally scheduling real world sports leagues by reduction to SAT, Report 646, Institut für Betriebswirtschaftslehre, Universität Kiel.

103
Horton, J.D. (1989) Hamilton path tournament designs, Ars Combinatoria 27, 69-74.

104
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.

105
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.

106
Ikebe, Y.T., Tamura, A. (2008) On the existence of sports schedules with multiple venues, Discrete Applied Mathematics 156, 1694-1710.

107
Irnich, S. (2010) A new branch-and-price algorithm for the traveling tournament problem, European Journal of Operational Research 204, 218-228.

108
Keedwell, A.D. (2000) Construction, properties and application of finite neofields, Comment. Math. Univ. Carolinae 41, 283-297.

109
Kendall, G. (2008) Scheduling English football fixtures over holiday periods, Journal of the Operational Research Society 59, 743-755.

110
Kendall, G., Knust, S., Ribeiro, C.C., Urrutia, S. (2010) Scheduling in sports: An annotated bibliography, Computers and Operations Research 37, 1-19.

111
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.

112
Kern, W., Paulusma, D. (2001) The new FIFA rules are hard complexity aspects of sports competitions, Discrete Applied Mathematics 108, 317-323.

113
Kern, W., Paulusma, D. (2004) The computational complexity of the elimination problem in generalized sports competitions, Discrete Optimization 1, 205-214.

114
Kirkman, T.P. (1847) On a problem in combinations, Cambridge and Dublin Mathematics Journal 2,191-204.

115
Knust, S. (2008) Scheduling sports tournaments on a single court minimizing waiting times, Operations Research Letters 36, 471-476.

116
Knust, S. (2010) Scheduling non-professional table-tennis leagues, European Journal of Operational Research 200, 358-367.

117
Knust, S., Lücking, D. (2009) Minimizing costs in round robin tournaments with place constraints, Computers and Operations Research 36, 2937-2943.

118
Knust, S., Thaden, M. von (2006) Balanced home-away assignments, Dicrete Optimization 3, 354-365.

119
Kostuk, K.J. (1997) A decision support system for a large, multi-event tournament, INFOR 35, 183-195.

120
Kujansuu, E., Lindberg, T., Mäkinen, E. (1999) The stable roommates problem and chess tournament pairings, Divulgaciones Matematicas 7, 19-28.

121
Lamken, E.R. (1990) Generalized balanced tournament designs, Transactions of the American Mathematical Society 318, 473-490.

122
Lamken, E.R. (1996) A few more partitioned balanced tournament designs, Ars Combinatoria 43, 121-134.

123
Lamken, E.R. (1997) The existence of partitioned generalized balanced tournament designs with block size 3, Designs, Codes and Cryptography 11, 37-71.

124
Lamken, E.R., Vanstone, S.A. (1985) The existence of factored balanced tournament designs, Ars Combinatoria 19, 157-160.

125
Lamken, E.R., Vanstone, S.A. (1987) The existence of partitioned balanced tournament designs, Annals of Discrete Mathematics 34, 339-352.

126
Lamken, E.R., Vanstone, S.A. (1988) Orthogonal resolutions in odd balanced tournament designs, Graphs and Combinatorics 4, 241-255.

127
Lamken, E.R., Vanstone, S.A. (1989) Balanced tournament designs and related topics, Discrete Mathematics 77, 159-176.

128
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.

129
Lim, A., Zhang, X. (2003) Integer programming and simulated annealing for scheduling sports competition on multiple venues, Proceedings MIC 2003.

130
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.

131
Lim, A., Rodrigues, B., Zhang, X. (2006) Scheduling sports competitions at multiple venues - revisited, European Journal of Operational Research 175, 171-186.

132
McAloon, K., Tretkoff, C., Wetzel, G. (1997) Sports league scheduling, in: Proceedings of the 3rd ILOG Optimization Suite International Users Conference, Paris.

133
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.

134
Melo, R.A., Urrutia, S., Ribeiro, C.C. (2009) The traveling tournament problem with predefined venues, Journal of Scheduling 12, 607-622.

135
Mendelsohn, E., Rosa, A. (1985) One-factorizations of the complete graph - a survey, Journal of Graph Theory 9, 43-65.

136
Mendelsohn, E., Rodney, P. (1994) The existence of court balanced tournament designs, Discrete Mathematics 133, 207-216.

137
Mitchell, J.E. (2000) Realignment in the national football league, Working Paper, Mathematical Sciences, Rensselaer Polytechnic Institute Troy, NY 12180.

138
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.

139
Miyashiro, R., Matsui, T. (2005) A polynomial-time algorithm to find an equitable home-away assignment, Operations Research Letters 33, 235-241.

140
Miyashiro, R., Matsui, T. (2006) Semidefinite programming based approaches to the break minimization problem, Computers and Operations Research 33, 1975-1982.

141
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.

142
Nemhauser, G.L., Trick, M.A. (1998) Scheduling a major college basketball conference, Operations Research 46, 1-8.

143
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.

144
Nowak, M., Epelman, M., Pollock, S.M. (2006) Assignment of swimmers to dual meet events, Computers and Operations Research 33, 1951-1962.

145
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.

146
Perron, L. (2005) Alternate modelling in sport scheduling, in: P. van Beek (ed.), CP 2005, Lecture Notes in Computer Science 3709, Springer, 797-801.

147
Post, G., Woeginger, G.J. (2006) Sports tournaments, home-away assignments, and the break minimization problem, Discrete Optimization 3, 165-173.

148
Rasmussen, R.V. (2008) Scheduling a triple round robin tournament for the best Danish soccer league, European Journal of Operational Research 185, 795-810.

149
Rasmussen, R.V., Trick, M.A. (2008) Round robin scheduling - a survey, European Journal of Operational Research 188, 617-636.

150
Rasmussen, R.V., Trick, M.A. (2007) A Benders approach for the constrained minimum break problem, European Journal of Operational Research 177, 198-213.

151
Rasmussen, R.V., Trick, M.A. (2009) The timetable constrained distance minimization problem, Annals of Operations Research 171, 45-59.

152
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.

153
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.

154
Ribeiro, C.C., Urrutia, S. (2004) OR on the ball: applications in sports scheduling and management, OR/MS Today 31, 50-54.

155
Ribeiro, C.C., Urrutia, S. (2006) Scheduling the Brazilian soccer championship, in: E. Burke and H. Rudova (eds.), PATAT 2006, Proceedings, 481-483.

156
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.

157
Ribeiro, C.C., Urrutia, S. (2007) Heuristics for the mirrored traveling tournament problem, European Journal of Operational Research 179, 775-787.

158
Robinson, L.W. (1991) Baseball playoff elimination: an application of linear programming, Operations Research Letters 10, 67-74.

159
Rodney, P. (1995) The existence of interval-balanced tournament designs, Journal of Combinatorial Mathematics and Combinatorial Computing 19, 161-170.

160
Rosa, A., Wallis, W. (1982) Premature sets of 1-factors or how not to schedule round robin tournaments, Discrete Applied Mathematics 4, 217-226.

161
Russell, K.G. (1980) Balancing carry-over effects in round robin tournaments, Biometrika 67, 127-131.

162
Russell, R.A., Leung, J.M. (1994) Devising a cost effective schedule for a baseball league, Operations Research 42, 614-625.

163
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.

164
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.

165
Schaerf, A. (1999) Scheduling sport tournaments using constraint logic programming, Constraints 4, 43-65.

166
Schellenberg, P.J., van Rees, G.H.J., Vanstone, S.A. (1977) The existence of balanced tournament designs, Ars Combinatoria 3, 303-318.

167
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.

168
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.

169
Schreuder, J.A.M. (1980) Constructing timetables for sport competitions, Mathematical Programming Study 13, 58-67.

170
Schreuder, J.A.M. (1992) Combinatorial aspects of construction of competition dutch professional football leagues, Discrete Applied Mathematics 35, 301-312.

171
Schreuder, J.A.M. (1993) Construction of fixture lists for professional football leagues, Ph.D. thesis, University of Strathclyde, Glasgow.

172
Straley, T.H. (1983) Scheduling designs for a league tournament, Ars Combinatoria 15, 193-200.

173
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.

174
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.

175
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.

176
Suzuka, A., Saruwatari, Y., Yoshise, A. (2002) Solving sports scheduling problems using network structure, Proceedings PATAT 2002, KaHo Sint-Lieven, Gent, Belgium.

177
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.

178
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.

179
Trick, M.A. (2004) Using sports scheduling to teach integer programming, INFORMS Transactions on Education 5, 10-17.

180
Urban, T.L., Russell, R.A. (2003) Scheduling sports competitions on multiple venues, European Journal of Operational Research 148, 302-311.

181
Urrutia, S., Ribeiro, C.C. (2006) Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Discrete Applied Mathematics 154, 1932-1938.

182
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.

183
Van Voorhis, T.V. (2002) Highly constrained college basketball scheduling, Journal of the Operational Research Society 53, 603-609.

184
Van Voorhis, T.V. (2005) College basketball scheduling with travel swings, Computers & Industrial Engineering 48, 163-172.

185
van't Hof, P., Post, G., Briskorn, D. (2009) Round-robin tournaments with minimum number of breaks and two teams per club, Report 648, Institut für Betriebswirtschaftslehre, Universität Kiel.

186
Wallis, W.D. (1983) A tournament problem, Journal of the Mathematical Society, Series B 24, 289-291.

187
Walser, J.P. (1999) Integer optimization by local search - a domain-independent approach, Lecture Notes in Artificial Intelligence 1637, Springer, Berlin-Heidelberg.

188
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.

189
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.

190
Werra, D. de (1980) Geography, games, and graphs, Discrete Applied Mathematics 2, 327-337.

191
Werra, D. de (1981) Scheduling in sports, in: P. Hansen (ed.), Studies on Graphs and Discrete Programming, 381-395.

192
Werra, D. de (1982) Minimizing irregularities in sports schedules using graph theory, Discrete Applied Mathematics 4, 217-226.

193
Werra, D. de (1985) On the multiplication of divisions: the use of graphs for sports scheduling, Networks 15, 125-136.

194
Werra, D. de (1988) Some models of graphs for scheduling sports competitions, Discrete Applied Mathematics 21, 47-65.

195
Werra, D. de, Descombes, J.L., Masson, P. (1990) A constrained sports scheduling problem, Discrete Applied Mathematics 26, 41-49.

196
Werra, D. de, Ekim, T., Raess, C. (2006) Construction of sports schedules with multiple venues, Discrete Applied Mathematics 154, 47-58.

197
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.

198
Wright, M. (1991) Scheduling English cricket umpires, Journal of the Operational Research Society 42, 447-452.

199
Wright, M. (1992) A fair allocation of county cricket opponents, Journal of the Operational Research Society 43, 195-201.

200
Wright, M. (1994) Timetabling county cricket fixtures using a form of tabu search, Journal of the Operational Research Society 45, 758-770.

201
Wright, M. (2005) Scheduling fixtures for New Zealand cricket, IMA Journal of Management Mathematics 16, 99-112.

202
Wright, M. (2006) Scheduling fixtures for basketball New Zealand, Computers and Operations Research 33, 1875-1893.

203
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.

204
Yavuz, M., Inan, U.H., Figlali, A. (2008) Fair referee assignments for professional football leagues, Computers and Operations Research 35, 2937-2951.


Sigrid Knust 2010-02-15