Pages that link to "Item:Q2398424"
From MaRDI portal
The following pages link to Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424):
Displaying 18 items.
- Elective course student sectioning at Danish high schools (Q284401) (← links)
- 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)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university (Q1687659) (← links)
- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745) (← links)
- Practices in timetabling in higher education institutions: a systematic review (Q1730752) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study (Q2225651) (← links)
- A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning (Q6109295) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
- A robust multi-project scheduling problem under a resource dedication-transfer policy (Q6573375) (← links)
