Pages that link to "Item:Q3518833"
From MaRDI portal
The following pages link to A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem (Q3518833):
Displaying 17 items.
- Operational research in education (Q319179) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups (Q835589) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
- Neighborhood portfolio approach for local search applied to timetabling problems (Q2506215) (← links)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
- (Q2779804) (← links)
