A Network Flow Based Construction for a GRASP + SA Algorithm to Solve the University Timetabling Problem.
Edmar Hell KampkeLeonardo Moreli ScheidegerGeraldo Regis MauriMaria Cláudia Silva BoeresPublished in: ICCSA (3) (2019)
Keyphrases
- network flow
- simulated annealing
- optimal solution
- optimization algorithm
- linear programming
- computational complexity
- dynamic programming
- min cost
- network flow problem
- optimization model
- tabu search
- np hard
- objective function
- cost function
- integer programming
- optimization process
- memetic algorithm
- timetabling problem
- collaborative filtering
- upper bound
- constraint satisfaction
- special case
- search algorithm
- max flow
- neural network