1. Applegate, D., Bixby, R., Chvatal, V., Cook, W.: On the Solution of Traveling Salesman Problems. Documenta Mathematica (Journal der Deutschen Mathematiker-Verinigung, International Congress of Mathematicians), 645–656 (1998)
2. Ball, B.C., Webster, D.B.: Optimal Scheduling for Even-Numbered Team Athletic Conferences. AIIE Trans. 9, 161–169 (1977)
3. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-And-Price: Column Generation for Huge Integer Programs. Oper. Res. 46, 316–329 (1998)
4. Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange Relaxation and Constraint Programming Collaborative Schemes for Traveling Tournament Problems. In: CPAIOR, Wye College, pp. 15–26 (2001)
5. Easton, K.: Using Integer and Constraint Programming to Solve Sports Scheduling Problems. Doctoral Dissertation, Georgia Institute of Technology, Atlanta (2002)