Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem.
Niels-Christian F. BaggerGuy DesaulniersJacques DesrosiersPublished in: J. Sched. (2019)
Keyphrases
- valid inequalities
- timetabling problem
- integer programming
- traveling salesman problem
- feasible solution
- mixed integer
- memetic algorithm
- linear programming
- cutting plane algorithm
- mixed integer programming
- tabu search
- integer programming formulation
- cutting plane
- integer program
- lower and upper bounds
- hyper heuristics
- column generation
- linear programming relaxation
- examination timetabling
- convex hull
- network design problem
- primal dual
- continuous variables
- lagrangian relaxation
- randomly generated
- linear program
- np hard
- lp relaxation
- lower bound
- evolutionary computation
- optimal solution
- production planning
- machine learning
- lot sizing
- upper bound
- scheduling problem