Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. Bartsch, A. Drexl, and S. Kröger (2006) Scheduling the Professional Soccer Leagues of Austria and Germany. Computers & Operations Research, 33: 1907–1937
D. Briskorn, A. Drexl, and F. C. R. Spieksma (2006) Round Robin Tournaments and Three Index Assignment. Working Paper
D. de Werra. Geography, Games and Graphs (1980) Discrete Applied Mathematics, 2: 327–337
F. Della Croce and D. Oliveri (2006) Scheduling the Italian Football League: An ILP-Approach. Computers & Operations Research, 33:1963–1974
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Briskorn, D., Drexl, A. (2007). Branching Based on Home-Away-Pattern Sets. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_83
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)