The following pages link to (Q2779799):
Displaying 12 items.
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- A survey of school timetabling research (Q475201) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- Applying evolutionary computation to the school timetabling problem: The Greek case (Q941551) (← links)
- An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
- Optimal student sectioning on mandatory courses with various sections numbers (Q1730755) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Efficient solutions for a university timetabling problem through integer programming (Q1887870) (← links)
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
