Pages that link to "Item:Q1761891"
From MaRDI portal
The following pages link to A branch-and-cut procedure for the Udine course timetabling problem (Q1761891):
Displaying 10 items.
- Fairness in academic course timetabling (Q284412) (← links)
- Operational research in education (Q319179) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem (Q342574) (← links)
- The generalized balanced academic curriculum problem with heterogeneous classes (Q475183) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
- Benders decomposition for curriculum-based course timetabling (Q1652557) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
