Sciweavers

Share
TCS
2011

Complexity of the traveling tournament problem

8 years 1 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 computationally hard ever
Clemens Thielen, Stephan Westphal
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TCS
Authors Clemens Thielen, Stephan Westphal
Comments (0)
books