Pages that link to "Item:Q3534665"
From MaRDI portal
The following pages link to Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm (Q3534665):
Displaying 10 items.
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- A harmony search algorithm for university course timetabling (Q1761885) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (Q2668751) (← links)