Pages that link to "Item:Q976395"
From MaRDI portal
The following pages link to Hybrid variable neighbourhood approaches to university exam timetabling (Q976395):
Displayed 17 items.
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling (Q398923) (← links)
- A constructive approach to examination timetabling based on adaptive decomposition and ordering (Q475165) (← links)
- Memetic techniques for examination timetabling (Q475166) (← links)
- Adaptive selection of heuristics for improving exam timetables (Q475182) (← links)
- A multiobjective framework for heavily constrained examination timetabling problems (Q613763) (← 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)
- Case-based heuristic selection for timetabling problems (Q880536) (← links)
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem (Q1014945) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- A new model for automated examination timetabling (Q1761908) (← links)
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- New integer linear programming approaches for course timetabling (Q2468480) (← links)
- Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization (Q2840787) (← links)