Enhancing Timetable Solutions with Local Search Methods
暂无分享,去创建一个
[1] G. Dueck. New optimization heuristics , 1993 .
[2] Gilbert Laporte,et al. Recent Developments in Practical Examination Timetabling , 1995, PATAT.
[3] W CarterMichael. A survey of practical applications of examination timetabling algorithms , 1986 .
[4] E. Burke,et al. A New Adaptive Heuristic Framework for Examination Timetabling Problems , 2002 .
[5] Edmund K. Burke,et al. Examination Timetabling in British Universities: A Survey , 1995, PATAT.
[6] Luca Di Gaspero,et al. Tabu Search Techniques for Examination Timetabling , 2000, PATAT.
[7] Michael W. Carter,et al. OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..
[8] George M. White,et al. Examination Timetables and Tabu Search with Longer-Term Memory , 2000, PATAT.
[9] Edmund K. Burke,et al. Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.
[10] Gilbert Laporte,et al. Examination Timetabling: Algorithmic Strategies and Applications , 1994 .
[11] Sanja Petrovic,et al. Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..
[12] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[13] Gerhard W. Dueck,et al. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .