Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
(2005)
Book Chapter
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which inte... Read More about Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems.