Branching Based on Home-Away-Pattern Sets
Scheduling a sports league requires to solve a hard combinatorial optimization problem. We consider a league of a set T of n teams supposed to play in a single round robin tournament (SRRT). Accordingly, each team i ∈ T has to play against each other team j ∈ T, j ≠ i, exactly one match. The tournament is partitioned into matchdays (MD) being periods where matches can be carried out. Each team i ∈ T shall play exactly once per MD. Hence, we have a compact structure resulting in an ordered set P of n −1 MDs.
KeywordsSport League Automate Timetabling Soccer League Lower Memory Requirement Proven Optimality
Unable to display preview. Download preview PDF.
- 2.D. Briskorn, A. Drexl, and F. C. R. Spieksma (2006) Round Robin Tournaments and Three Index Assignment. Working PaperGoogle Scholar
- 5.R. Miyashiro, H. Iwasaki, and T. Matsui (2003) Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. In: E. Burke and P. de Causmaecker (eds) Proceedings of the 4th international conference on the practice and theory of automated timetabling. Lecture Notes in Computer Science 2740, pages 78–99. Springer, Berlin, Germany, 2003.Google Scholar