This article describes an optimization process used to schedule the First Division of
Argentina's professional volleyball league. The teams in the league are grouped into …

The traveling tournament problem (ttp) consists of finding a distance-minimal double round-
robin tournament where the number of consecutive breaks is bounded. For solving the …

The traveling tournament problem is a well-known sports league scheduling problem
famous for its practical hardness. Given an even number of teams with symmetric distances …

The well-known traveling tournament problem is a hard optimization problem in which a
double round robin sports league schedule has to be constructed while minimizing the total …

This work presents an iterative-deepening A∗(IDA∗) based approach to the traveling
tournament problem (TTP). The TTP is a combinatorial optimization problem which abstracts …

The bipartite traveling tournament problem (BTTP) is an NP-complete scheduling problem
whose solution is a double round-robin inter-league tournament with minimum total travel …

In a double round-robin tournament involving n teams, every team plays 2 (n− 1) games,
with one home game and one away game against each of the other n− 1 teams. Given a …

Sports scheduling has been an extremely active area of research over the past twenty
20years. One important reason for this is that the computational methods for creating …

The travelling tournament problem (TTP) is an important and well-known problem within the
collective sports research community. The problem is NP-hard which makes difficult finding …

The sports timetabling problem is a combinatorial optimization problem that consists of
creating a timetable that defines against whom, when and where teams play games. This is …