| Article ID: | iaor20051857 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 3 |
| Start Page Number: | 235 |
| End Page Number: | 241 |
| Publication Date: | May 2005 |
| Journal: | Operations Research Letters |
| Authors: | Matsui Tomomi, Miyashiro Ryuhei |
| Keywords: | timetabling, combinatorial analysis, programming: nonlinear |
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