EEMCS EPrints Service
van 't Hof, P. and Post, G.F. and Briskorn, D. (2010) Constructing fair round robin tournaments with a minimum number of breaks. Operations research letters, 38 (6). pp. 592-596. ISSN 0167-6377 *** ISI Impact 0,537 ***
This is the latest version of this eprint.
Full text available as:
Official URL: http://dx.doi.org/10.1016/j.orl.2010.08.008
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.
Available Versions of this Item
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item