Login / Signup
A graph-based hyper-heuristic for educational timetabling problems.
Edmund K. Burke
Barry McCollum
Amnon Meisels
Sanja Petrovic
Rong Qu
Published in:
Eur. J. Oper. Res. (2007)
Keyphrases
</>
timetabling problem
hyper heuristics
examination timetabling
memetic algorithm
graph coloring
e learning
cutting stock problems
genetic programming
graph model
neural network
artificial intelligence
optimal solution
upper bound