A mathematical formulation for constructing feasible solutions for the Post Enrollment Course Timetabling Problem.
Angelos DimitsasVasileios NastosChristos ValouxisChristos GogosPublished in: SEEDA-CECNSM (2022)
Keyphrases
- feasible solution
- mathematical formulation
- timetabling problem
- tabu search
- memetic algorithm
- linear programming
- examination timetabling
- hyper heuristics
- optimal solution
- lagrangian relaxation
- objective function
- mathematical model
- solution quality
- simulated annealing
- convex hull
- mixed integer program
- mixed integer
- metaheuristic
- solution space
- search procedure
- scheduling problem
- genetic algorithm
- test problems
- search algorithm
- extreme points
- linear programming relaxation
- infeasible solutions
- vehicle routing problem
- neural network
- linear program
- artificial neural networks
- learning algorithm