References

Anagnostopoulos, A., L. Michel, P.V. Hentenryck and Y. Vergados, 2006. A simulated annealing approach to the traveling tournament problem. J. Scheduling, 9: 177-193.
CrossRef  |  Direct Link  |  

Benoist, T., F. Laburthe and B. Rottembourg, 2001. Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. Proc. CPAIOR., 1: 15-26.
Direct Link  |  

Di Gaspero, L. and A. Schaerf, 2007. A composite-neighborhood TABU search approach to the traveling tournament problem. J. Heuristics, 13: 189-207.
Direct Link  |  

Easton, K., G. Nemhauser and M. Trick, 2001. The Traveling Tournament Problem Description and Benchmarks. In: Principles and Practice of Constraint Programming, Walsh, T. (Ed.). Springer, Berlin, Germany, ISBN:978-3-540-42863-3, pp: 580-584.

Easton, K., G. Nemhauser and M. Trick, 2002. Solving the travelling tournament problem: A combined integer programming and constraint programming approach. Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT’02), August 21-23, 2002, Springer, Gent, Belgium, ISBN:978-3-540-40699-0, pp: 100-109.

Irnich, S., 2010. A new branch-and-price algorithm for the traveling tournament problem. Eur. J. Oper. Res., 204: 218-228.
CrossRef  |  Direct Link  |  

Lee, J.H., Y.H. Lee and Y.H. Lee, 2006. Mathematical modeling and tabu search heuristic for the traveling tournament problem. Proceedings of the International Conference on Computational Science and its Applications, May 8-11, 2006, Springer, Glasgow, Scotland, UK., pp: 875-884.

Lim, A., B. Rodrigues and X.Zhang, 2006. A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur. J. Oper. Res., 174: 1459-1478.
CrossRef  |  Direct Link  |  

Russell, R.A. and T.L. Urban, 2006. A constraint programming approach to the multiple-venue, sport-scheduling problem. Comput. Oper. Res., 33: 1895-1906.
CrossRef  |  Direct Link  |  

Yamaguchi, D., S. Imahori, R. Miyashiro and T. Matsui, 2011. An improved approximation algorithm for the traveling tournament problem. Algorithmica, 61: 1077-1091.
Direct Link  |