Some Balanced Colouring Algorithms For Examination Timetabling
暂无分享,去创建一个
[1] Leland L. Beck,et al. Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.
[2] Gilbert Laporte,et al. Examination timetabling by computer , 1982, Comput. Oper. Res..
[3] George M. White,et al. Towards The Construction Of Optimal Examination Schedules , 1979 .
[4] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..
[5] C. V. Eynden,et al. A proof of a conjecture of Erdös , 1969 .
[6] Dominique de Werra,et al. Compactness and balancing in scheduling , 1977, Math. Methods Oper. Res..