A simulated annealing approach to the travelling tournament problem

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1357-1358

  Anagnostopoulos, A ^a   Michel, L ^a   Van Hentenryck, P ^a   Vergados, Y ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SALIENT FEATURES; SIMULATED ANNEALING ALGORITHMS; TRAVELING TOURNAMENT PROBLEMS;

ARTIFICIAL INTELLIGENCE; OPERATIONS RESEARCH; SPORTS;

SIMULATED ANNEALING;

EID: 80052166002     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. T Benoist, F. Laburthe, and B. Rottembourg. Lagrange Relaxation and Constraint Programming Collaborative Schemes for Travelling Tournament Problems. In CP-AI-OR'2001, 2001.
2. D.T. Connelly. General Purpose Simulated Annealing. Journal of Operations Research, 43, 1992.
3. Juan A. Diaz and Elena Fernandez. A tabu search heuristic for the generalized assignment problem. EJOR, 132(1):22-38,2001.
4. K. Easton, G. Nemhauser, and M. Trick. The traveling tournament problem description and benchmarks. In CP'01), 2001.
5. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
6. M. Laguna, J.P. Kelly, Gonzalez-Velarde, and F. Glover. Tabu search for the multilevel generalized assignment problems. EJOR, 42:677-687,1995.
7. E. Pesch and F. Glover. TSP Ejection Chains. Discrete Applied Mathematics, 76:165-181,1997. (Pubitemid 127414709)
8. M. Trick. http://mat.gsia.cmu.edu/TOURN/, 2002.