A Mathematical Model for the Traveling Tournament Problem
Abstract
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
Abstract
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
Browse Journals
Journal Policies
Information
Useful Links
- Call for Papers
- Submit Your Paper
- Publish in Your Native Language
- Subscribe the Journal
- Frequently Asked Questions
- Contact the Executive Editor
- Recommend this Journal to Librarian
- View the Current Issue
- View the Previous Issues
- Recommend this Journal to Friends
- Recommend a Special Issue
- Comment on the Journal
- Publish the Conference Proceedings
Latest Activities
Resources
Visiting Status
 Today |
17 |
| Yesterday |
263 |
| This Month |
4272 |
| Last Month |
4321 |
 All Days |
1016423 |
 Online |
3 |
