Pages that link to "Item:Q296691"
From MaRDI portal
The following pages link to Effective learning hyper-heuristics for the course timetabling problem (Q296691):
Displaying 14 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- A decision support approach to automatic timetabling in higher education institutions (Q310350) (← links)
- Operational research in education (Q319179) (← links)
- An iterated multi-stage selection hyper-heuristic (Q322405) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties (Q2116843) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning (Q2184164) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm (Q3534665) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
