Login / Signup
A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem.
Pasquale Avella
Maurizio Boccia
Sandro Viglione
Igor Vasilyev
Published in:
MOTOR (2) (2019)
Keyphrases
</>
timetabling problem
real world
memetic algorithm
hyper heuristics
examination timetabling
mixed integer programming
tabu search
graph colouring
high school
simulated annealing
artificial intelligence
branch and bound
feasible solution
artificial neural networks
dynamic programming
search tree