Challenge Traveling Tournament Instances (Relaxed)

Last Update: May 10, 2013

Description of the Problem

This problem is a variant of the Traveling Tournament Problem and is proposed by Renjun Bao and Michael Trick. In this variant, the schedule is not compact: teams have byes in their schedule. The number of byes is controlled by a parameter K, the number of byes per team in the schedule. K=0 corresponds to the normal TTP.

Byes are ignored in determining the length of a homestand or roadtrip, and in determining whether a repeater has occured.

Instances and Best Values

Any instance from the Traveling Tournament Problem can be used for this.