Pages that link to "Item:Q300032"
From MaRDI portal
The following pages link to Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032):
Displaying 10 items.
- Operational research in education (Q319179) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- Scheduling of maintenance work of a large-scale tramway network (Q724038) (← links)
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
- Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- An effective hybrid local search approach for the post enrolment course timetabling problem (Q2656559) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)