Constructing fair round robin tournaments with a minimum number of breaks

Share/Save/Bookmark

Hof, Pim van 't and Post, Gerhard and Briskorn, Dirk (2010) Constructing fair round robin tournaments with a minimum number of breaks. Operations Research Letters, 38 (6). pp. 592-596. ISSN 0167-6377

[img] PDF
Restricted to UT campus only
: Request a copy
233kB
Abstract:Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n−2, teams of the same club never play at home simultaneously, and they play against each other in the first round. We also consider a fairness constraint related to different playing strengths of teams competing in the tournament.
Item Type:Article
Copyright:© 2010 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/74988
Official URL:http://dx.doi.org/10.1016/j.orl.2010.08.008
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 271167