Efficient solutions for a university timetabling problem through integer programming.
Sophia DaskalakiTheodore BirbasPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- integer programming
- efficient solutions
- timetabling problem
- bicriteria
- memetic algorithm
- bi objective
- examination timetabling
- np hard
- hyper heuristics
- optimal solution
- heuristic methods
- constraint programming
- linear programming
- set covering problem
- valid inequalities
- cutting plane
- lagrangian relaxation
- integer program
- column generation
- facility location
- cutting plane algorithm
- transportation problem
- network design problem
- set covering
- search space
- combinatorial optimization
- objective function
- evolutionary computation
- set partitioning
- machine learning