Pages that link to "Item:Q337258"
From MaRDI portal
The following pages link to Integer programming methods for large-scale practical classroom assignment problems (Q337258):
Displaying 12 items.
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- Genetic based discrete particle swarm optimization for elderly day care center timetabling (Q342133) (← links)
- Quality recovering of university timetables (Q666944) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university (Q1687659) (← links)
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning (Q2184164) (← links)
- An overview of curriculum-based course timetabling (Q2355018) (← links)
- Integer programming for minimal perturbation problems in university course timetabling (Q2398425) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918669) (← links)
- Comments on: ``An overview of curriculum-based course timetabling'' (Q5971109) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
