A Mathematical Model for the Traveling Tournament Problem
J. Mark Dorrepaal, George Chackman, Brian Dorrepaal

The traveling tournament problem (TTP) is a sports scheduling problem which has generated considerable interest over the last decade. In this paper a mathematical model is introduced in which the home venues of all teams lie at equal intervals along a straight line. This model is applied to the six team problem and brute force methods are used to find all optimal schedules. These schedules are analyzed and categorized into equivalence classes. A number of schedules which have interesting properties are printed in full.

Full Text: PDF     DOI: 10.15640/arms.v3n2a2