[1] E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, 1 (1959) 269–271.
[2] K. Easton, G. Nemhauser and M. Trick, The traveling tournament problem: description and benchmarks, Proceeding of the 7th International Conference on Principles and Practice of Constraint Programming, (2001) 580–584.
[3] S. Hesse, Canadian secientist uses math to green Japanese baseball, http://www.japantimes.co.jp/life/2012/11/25/
environment/canadian-scientist-uses-math-to-green-japanese-baseball/, (2012).
[4] R. Hoshino and K. Kaearabayashi, The multi-round balanced traveling tournament problem, Proceeding of the 21th International Conference on Automated Planning and Scheduling (ICAPS), (2011) 106–113.
[5] R. Hoshino and K. Kaearabayashi, The inter-league extension of the traveling tournament problem and its application to sports scheduling, Proceeding of the 25th AAAI Conference on Artificial Intelligence, (2011) 977–984.
[6] R. Hoshino and K. Kaearabayashi, The distance-optimal inter-league Schedule for Japanese pro baseball, Proceedings of the ICAPS 2011 Workshop on Constraint Satisfaction Techniques for Plannig and Scheduling Problems (COPLAS), (2011) 71–78.
[7] R. Hoshino and K. Kaearabayashi, A multi-round generalization of the traveling tournament problem and its application to Japanese baseball, European Journal of Operational Research, 215 (2011) 481–497.
[8] R. Hoshino and K. Kaearabayashi, Scheduling bipartite tournaments to minimize total travel distance, Journal of Artifical Intelligence Research, 42 (2011) 91–124.
[9] R. Hoshino and K. Kaearabayashi, Balancing the Traveling Tournament Problem for Weekday and Weekend Games, Proceedings of the 2013 AAAI Conference, to appear.
[10] G. Kendall, S. Knust, C. C. Ribeiro and S. Urrutia, Scheduling in sports: a annotated bibliography, Computer and Operations Research, 37 (2010) 1–19.
)