Gschwind, Timo; Irnich, Stefan - In: European Journal of Operational Research 210 (2011) 2, pp. 452-456
The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between...