Sciweavers

TCS
2011
13 years 6 months ago
Complexity of the traveling tournament problem
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
Clemens Thielen, Stephan Westphal
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 11 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf