The Traveling Tournament Problem Description and Benchmarks (2001)
by
Kelly Easton
,
George Nemhauser
,
Michael Trick
| Citations: | 34 - 3 self |
BibTeX
@MISC{Easton01thetraveling,
author = {Kelly Easton and George Nemhauser and Michael Trick},
title = {The Traveling Tournament Problem Description and Benchmarks},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The Traveling Tournament Problem is a sports timetabling problem that abstracts the important issues in creating timetables where team travel is an important issue. Instances of this problem seem to be very difficult to solve even for very small cases. Given the practical importance of solving instances similar to these, this makes this problem an interesting challenge for combinatorial optimization techniques. We introduce this problem, give some interesting classes of instances and give some base computational results.
