References

Ahmed, Z.K., 2004. Genetic algorithm for the Traveling salesman problem using sequential constructive crossover operator. Int. J. Biomet. Bioinform., 3: 96-96.
Direct Link  |  

Biajoli, F. and L. Lorena, 2006. Mirrored Traveling Tournament Problem: An Evolutionary Approach. In: Advances in Artificial Intelligence-IBERAMIA-SBIA 2006, Sichman, J.S., H. Coelho and S.O. Rezende (Eds.). Springer, Berlin, Germany, ISBN:978-3-540-45462-5, pp: 208-217.

Chartrand, G. and P. Zhang, 2005. Introduction to Graph Theory. McGraw-Hill, New York, USA., ISBN:9780072948622, Pages: 449.

De Carvalho, M.A.M. and L.A.N. Lorena, 2012. New models for the mirrored traveling tournament problem. Comput. Ind. Eng., 63: 1089-1095.
CrossRef  |  

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.

Ribeiro, C.C. and S. Urrutia, 2007. Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res., 179: 775-787.
Direct Link  |  

Urrutia, S. and C.C. Ribeiro, 2006. Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discrete Appl. Math., 154: 1932-1938.
Direct Link  |