Pages that link to "Item:Q1046051"
From MaRDI portal
The following pages link to A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051):
Displaying 18 items.
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- Operational research in education (Q319179) (← links)
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- A heuristic method to schedule training programs for small and medium enterprises (Q439435) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
- Metaheuristics for high school timetabling (Q1380726) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- A comparative study of modern heuristics on the school timetabling problem (Q1736706) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
- A matheuristic for solving inventory sharing problems (Q2669710) (← links)
- A SA-VNS approach for the high school timetabling problem (Q2840769) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
