2 search results - page 1 / 1 » Constructing fair round robin tournaments with a minimum num... |
ORL
2010
12 years 11 months ago
2010
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 ...
EOR
2007
13 years 4 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...