A polynomial-time algorithm to find an equitable home-away assignment

We propose a polynomial-time algorithm to find an equitable home-away assignment for a given timetable of a round-robin tournament. Our results give an answer to a problem raised by Elf et al. (Oper. Res. Lett. 31 (2003) 343), which concerns the computational complexity of the break minimization problem in sports timetabling.