Strong Relaxations for the Train Timetabling Problem Using Connected Configurations.

Frank Fischer Thomas Schlechte

Published in: ATMOS (2017)

Keyphrases

timetabling problem
memetic algorithm
hyper heuristics
examination timetabling
lower bound
np hard
linear programming
machine learning
connected components
optimal configuration
genetic algorithm
dynamic programming