Construction of sports schedules with multiple venues

Discrete Applied Mathematics

Volumn 154, Issue 1, 2006, Pages 47-58

  De Werra, D ^a   Ekim, T ^a   Raess, C ^a  

^a EPFL   (Switzerland)

Author keywords

Complete graph; Edge coloring; Factorization; Sports scheduling

Indexed keywords

MATHEMATICAL MODELS; SCHEDULING;

COMPLETE GRAPH; EDGE COLORING; FACTORIZATION; SPORTS SCHEDULING;

GRAPH THEORY;

EID: 27744552785     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.03.011     Document Type: Article

References (12)

1. B.C. Ball, and D.B. Webster Optimal scheduling for even-numbered team athletic conference AITE Trans. 9 1977 161 179
2. C. Berge Graphs and Hypergraphs 1973 North-Holland Amsterdam
3. D.C. Blest, and D.G. Fitzgerald Scheduling sports competitions with a given distribution of times Discrete Appl. Math. 22 1988 9 19
4. D. de Werra Geography, games and graphs Discrete Appl. Math. 2 1980 327 337
5. D. de Werra Some models of graphs for scheduling sports competitions Discrete Appl. Math. 21 1988 47 65
6. J. Haselgrove, and J. Leeck A tournament design problem Amer. Math. Monthly 84 1977 198 201
7. M. Henz Scheduling a major college basketball conference: revisited Oper. Res. 49 2000 163 168
8. R. Miyashiro, H. Iwasaki, T. Matsui, Characterizing feasible pattern sets with a minimum number of breaks, in: E. Burke, P. de Causmaecker (Eds.), Patat 2002, Lecture Notes in Computer Science, vol. 2740, Springer, Berlin, 2003, pp. 78-99.
9. G. Nemhauser, and M. Trick Scheduling a major college basketball conference Oper. Res. 46 1998 1 8
10. P.J. Schellenberg, G.H.J. van Rees, and S.A. Vanstone The existence of balanced tournament design Ass Combinatoria 3 1977 303 317
11. T.L. Urban, and R.A. Russell Scheduling sports competitions on multiple venues European J. Oper. Res. 148 2003 302 311
12. T.L. Urban, R.A. Russell, A constraint-programming approach to the multiple-venue, sport-scheduling problem, Comput. Oper. Res. (special issue on OR in Sport) 2005, forthcoming.