Last Update: August 9, 2010
This problem is a variant of the Traveling Tournament Problem proposed by Douglas Moody. In this variant, teams do not play a double round robin tournament but rather there is a "Matchups" value between teams i and j, which gives the number of times i must visit j. The (regular) TTP is a Non-RR TTP with a matchup value of 1 for all i not equal to j.
The DIV instances come from Major League Baseball, with smaller instances taking just some of the divisional matchups. DIV5 is the full Major League Baseball schedule