A complete search method for the relaxed traveling tournament problem
The traveling tournament problem is a sports scheduling problem that includes two major issues in creating timetables: home/away pattern feasibility and travel distance. In this problem, the schedule must be compact: every team plays in every time slot. However, there are some sports leagues that ha...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2014
|
| Subjects: | |
| Online Access: | https://doaj.org/article/95c7bebf44ba460ba6c53c0e2963f990 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|