Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142657 | Operations Research Letters | 2013 | 5 Pages |
Abstract
In this paper, we present a constructive method to show the existence of group-balanced single round robin tournaments (SRRTs) with a minimum number of breaks, if the number of groups is a power of 2 with identical even group sizes. When the number of teams is a multiple of 4, we show the existence of group-changing SRRTs with a minimum number of breaks, if the union of some groups contains exactly half of the teams.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lishun Zeng, Shinji Mizuno,