Pages that link to "Item:Q1026761"
From MaRDI portal
The following pages link to Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761):
Displaying 23 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- Memetic techniques for examination timetabling (Q475166) (← links)
- Adaptive selection of heuristics for improving exam timetables (Q475182) (← links)
- Solving examination timetabling problems through adaption of heuristic orderings (Q596455) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
- Automated generation of constructive ordering heuristics for educational timetabling (Q1730754) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy (Q2085509) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- Adaptive linear combination of heuristic orderings in constructing examination timetables (Q2255942) (← links)
- Hyper-heuristic approaches for the response time variability problem (Q2275609) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling (Q2630226) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems (Q3161783) (← links)
- A practical three‐phase ILP approach for solving the examination timetabling problem (Q6067898) (← links)
