The traveling tournament problem with predefined venues

Journal of Scheduling

Volumn 12, Issue 6, 2009, Pages 607-622

  Melo, Rafael A ^a,b   Urrutia, Sebastián ^c   Ribeiro, Celso C ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Integer programming; Sports scheduling; Tournaments; Traveling tournament problem; Venues

Indexed keywords

APPLICATION AREA; COMMERCIAL SOLVERS; FEASIBLE SOLUTION; INTEGER PROGRAMMING FORMULATIONS; MATHEMATICAL STRUCTURE; NUMERICAL RESULTS; ROUND ROBIN TOURNAMENTS; SPORTS SCHEDULING;

DYNAMIC PROGRAMMING; SCHEDULING;

INTEGER PROGRAMMING;

EID: 72249118424     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0097-1     Document Type: Conference Paper

References (19)

1. A. Anagnostopoulos L. Michel P. Van Hentenryck Y. Vergados 2006 A simulated annealing approach to the traveling tournament problem Journal of Scheduling 9 177 193 10.1007/s10951-006-7187-8
2. E. Danna E. Rothberg C. Le Pape 2005 Exploring relaxation induced neighborhoods to improve mip solutions Mathematical Programming 102 71 90 10.1007/s10107-004-0518-7 (Pubitemid 40134692)
3. Duarte, A., Ribeiro, C. C., & Urrutia, S. (2007). A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy. In Th. Bartz-Beielstein, M.J. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, & M. Sampels (Eds.), Lecture notes in computer science : Vol. 4771. Hybrid metaheuristics, 4th international workshop (pp. 82-95). Berlin: Springer.
4. Durán, G., Noronha, T. F., Ribeiro, C. C., Souyris, S., & Weintraub, A. (2007). Branch-and-cut for a real-life highly constrained soccer tournament scheduling problem. In E. Burke, & Rudová H. (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 174-186). Berlin: Springer.
5. Easton, K., Nemhauser, G. L., & Trick, M. A. (2001). The traveling tournament problem: Description and benchmarks. In T. Walsh (Ed.), Lecture notes in computer science : Vol. 2239. Principles and practice of constraint programming (pp. 580-584). Berlin: Springer.
6. Easton, K., Nemhauser, G. L., & Trick, M. (2003). Solving the traveling tournament problem: A combined integer programming and constraint programming approach. In G. Goos, J. Hartmanis, & J. van Leeuwen (Eds.), Lecture notes in computer science : Vol. 2740. Practice and theory of automated timetabling IV (pp. 100-109). Berlin: Springer. (Pubitemid 137632810)
7. Easton, K., Nemhauser, G. L., & Trick, M. (2004). Sports scheduling. In J.T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 52.1-52.19). Boca Raton: CRC Press.
8. Henz, M. (1999) Constraint-based round robin tournament planning. In D. De Schreye (Ed.) International conference on logic programming (pp. 545-557), New Mexico.
9. Knust, S. (2007). Scheduling non-professional table-tennis leagues (Technical Report 270). Osnabrücker Schriften zur Mathematik.
10. S. Knust M. von Thaden 2006 Balanced home-away assignments Discrete Optimization 3 354 365 10.1016/j.disopt.2006.07.002 (Pubitemid 44354345)
11. Miyashiro, R., Iwasaki, H., & Matsui, T. (2003). Characterizing feasible pattern sets with a minimum number of breaks. In G. Goos, J. Hartmanis, & J. van Leeuwen (Eds.), Lecture notes in computer science : Vol. 2740. Practice and theory of automated timetabling IV (pp. 78-99). Berlin: Springer.
12. G. L. Nemhauser M. A. Trick 1998 Scheduling a major college basketball conference Operations Research 46 1 8 10.1287/opre.46.1.1
13. Rasmussen, R. V., & Trick, M. A. (2006). The timetable constrained distance minimization problem. In J.C. Beck, & B.M. Smith (Eds.), Lecture notes in computer science : Vol. 3990. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 167-181). Berlin: Springer.
14. R. V. Rasmussen M. A. Trick 2008 Round robin scheduling-a survey European Journal of Operational Research 188 617 636 10.1016/j.ejor.2007.05.046 (Pubitemid 351173482)
15. J. Régin 2001 Minimization of the number of breaks in sports scheduling problems using constraint programming DIMACS Series in Discrete Mathematics and Theoretical Computer Science 57 115 130
16. C. C. Ribeiro S. Urrutia 2007 Heuristics for the mirrored traveling tournament problem European Journal of Operational Research 179 775 787 10.1016/j.ejor.2005.03.061 (Pubitemid 46038589)
17. Ribeiro, C. C., & Urrutia, S. (2007b). Scheduling the Brazilian soccer championship. In E. Burke, & H. Rudová (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 149-159). Berlin: Springer.
18. E. Rothberg 2007 An evolutionary algorithm for polishing mixed integer programming solutions INFORMS Journal on Computing 19 534 541 10.1287/ijoc.1060.0189
19. Trick, M. (2007). Challenge traveling tournament instances. Online reference at http://mat.gsia.cmu.edu/TOURN/, last visited on August 10, 2007.