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 problem are equivalent when the distance between every pair of teams

• Type: Journal
• Year: 2006
• Where: DAM
• Authors: Sebastián Urrutia, Celso C. Ribeiro
• Keywords: Breaks Maximization Problem, DAM 2006, Distance Minimization Problem, Robin Tournament