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

@article{Miyashiro2005APA,
  title={A polynomial-time algorithm to find an equitable home-away assignment},
  author={Ryuhei Miyashiro and Tomomi Matsui},
  journal={Oper. Res. Lett.},
  year={2005},
  volume={33},
  pages={235-241}
}
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. © 2004 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.
20 Citations
13 References
Similar Papers

Similar Papers

Loading similar papers…