Solving the Travelling Tournament Problem: A combined integer programming and constraint programming approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2740, Issue , 2003, Pages 100-109

  Easton, Kelly ^a   Nemhauser, George ^a   Trick, Michael ^b  

^a Georgia Institute of Technology   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; INTEGER PROGRAMMING; OPERATIONS RESEARCH; ROUTERS; SCHEDULING;

BRANCH-AND-PRICE ALGORITHMS; CONSTRAINT PROGRAMMING; MINIMUM DISTANCE; OPTIMAL SOLUTIONS; PARALLEL IMPLEMENTATIONS; ROUND ROBIN TOURNAMENTS; SOLUTION METHODOLOGY; SPORTS TIMETABLING;

PROBLEM SOLVING;

EID: 21144436478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_6     Document Type: Article

References (11)

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) (1998) 645-656
2. Ball, B.C., Webster D.B.: Optimal Scheduling for Even-Numbered Team Athletic Conferences. AIIE Trans. (1977) 9 161-169
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. (1998) 46 316-329
4. Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange Relaxation and Constraint Programming Collaborative Schemes for Traveling Tournament Problems. CPAI-OR, Wye College (2001) 15-26
5. Easton, K.: Using Integer and Constraint Programming to Solve Sports Scheduling Problems. Doctoral Dissertation, Georgia Institute of Technology, Atlanta (2002)
6. Easton, K., Nemhauser, G.L., Trick M.A.: The Traveling Tournament Problem: Description and Benchmarks, Principle and Practices of Constraint Programming. In: Proc. CP'01. Lecture Notes in Computer Science, Vol. 2239. Springer-Verlag, Berlin Heidelberg New York (2001) 580-585
7. Gabow, H.N.: Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In: Proc. 1st Annu. ACM-SIAM Symp. Discr. Algorithms. SIAM, Philadelphia, PA (1990) 434-443
8. Henz, M.: Scheduling a Major College Basketball Conference: Revisted. Oper. Res. (2001) 49 163-168
9. Kirkpatrick, D.G., Hell, P.: On the Complexity of a Generalized Matching Problem. In: Proc. 10th Annu. ACM Symp. Theory Computing. Association for Computing Machinery, New York (1978) 240-245
10. Klabjan, D., Johnson, E.L., Nemhauser G.L.: Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching. Comput. Optim. Appl. (2001) 20 73-91
11. Russell, R.A., Leung, J.M.: Devising a Cost Effective Schedule for a Baseball League. Oper. Res. (1994) 42 614-625