Complexity of the traveling tournament problem

12 years 11 months ago

Download optimierung.mathematik.uni-kl.de

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

Real-time Traffic

TCS 2011 | Theoretical Computer Science | Tournament Problem | Tournament Timetabling | Well-known Benchmark Problem |

claim paper

» A simulated annealing and hillclimbing algorithm for the traveling tournament problem

» PopulationBased Simulated Annealing for Traveling Tournaments

» On the complexity of schedule control problems for knockout tournaments

» Maximizing breaks and bounding solutions to the mirrored traveling tournament problem

» Heuristics for the mirrored traveling tournament problem

» An Improved Approximation Algorithm for the Traveling Tournament Problem

» Clustering Search Approach for the Traveling Tournament Problem

» A new branchandprice algorithm for the traveling tournament problem

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TCS
Authors	Clemens Thielen, Stephan Westphal

Comments (0)

Sciweavers

Complexity of the traveling tournament problem

TCS 2011 | Theoretical Computer Science | Tournament Problem | Tournament Timetabling | Well-known Benchmark Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers