Approximating the Traveling Tournament Problem with Maximum Tour Length 2 (original) (raw)

Approximating the Traveling Tournament Problem with Maximum Tour Length 2

Algorithms and Computation, 2010

Abstract

Page 1. Approximating the Traveling Tournament Problem with Maximum Tour Length 2 Clemens Thielen and Stephan Westphal ... Abstract. We consider the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. ...

Stephan Westphal hasn't uploaded this paper.

Create a free Academia account to let Stephan know you want this paper to be uploaded.

Ask for this paper to be uploaded.