1. Applegate, D.R. Bixby, V. Chvatal,and W. Cook.1998. “On the solution of traveling salesman problems”, Documenta Mathematica Journal der Deutschen Mathematiker-Verinigung International Congress of Mathemeticians,645–656.
2. Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh,and P.H. Vance. 1998. “Branch-and-Price:Column Generation for Huge Integer Programs”, Operations Research 46:3,316–329.
3. Benoist, T.,F. Laburthe,and B. Rottembourg, 2001. “Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems”, CPAI-OR,Wye College,UK,15–26.
4. Campbell, R.T.,and D.S. Chen,1976. “A Minimum Distances Basketball Scheduling Problem”, in Optimal Strategies in Sports, S.P. Ladany and R.E Machol (eds.), North-Holland, Amsterdam, 32–41.
5. Henz, M.2001. “Scheduling a Major College Basketball Conference:Revisted”,Operations Research,49:1,.