1. Exploring grid implementations of parallel cooperative metaheuristics;Araújo,2007
2. Benoist, T., Laburthe, F., & Rottembourg, B. (2001). Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In: CP-AI-OR’2001, Wye College (pp. 15–26).
3. Solving mirrored traveling tournament problem benchmark instances with eight teams;Cheung;Discrete Optimization,2008
4. A Benders approach for computing lower bounds for the mirrored traveling tournament problem;Cheung;Discrete Optimization,2009
5. Solving the travelling tournament problem: A combined integer programming and constraint programming approach;Easton,2003