Minimizing the Carry-Over Eects Value in a Round-Robin Tournament

In this abstract, we deal with the problem of minimizing the carry-over effects value in a round-robin tournament. The carry-over eects value is an index of quality of a round-robin tournament schedule. We propose an eective algorithm for generating schedules of small carry-over eects values. The proposed algorithm produces better schedules than the previous best ones in short computational time. A round-robin tournament with the following properties is considered in this