| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524097 | Operations Research Letters | 2005 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ryuhei Miyashiro, Tomomi Matsui,