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

• Type: Journal
• Year: 2011
• Where: TCS
• Authors: Clemens Thielen, Stephan Westphal
• Keywords: TCS 2011, Theoretical Computer Science, Tournament Problem, Tournament Timetabling, Well-known Benchmark Problem