Sciweavers

ORL
2010
158views more  ORL 2010»
12 years 11 months ago
Constructing fair round robin tournaments with a minimum number of breaks
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 ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
DAM
2006
118views more  DAM 2006»
13 years 5 months ago
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
Sebastián Urrutia, Celso C. Ribeiro