Pages that link to "Item:Q2432892"
From MaRDI portal
The following pages link to A graph-based hyper-heuristic for educational timetabling problems (Q2432892):
Displayed 39 items.
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- Memetic techniques for examination timetabling (Q475166) (← links)
- Adaptive selection of heuristics for improving exam timetables (Q475182) (← links)
- A survey of school timetabling research (Q475201) (← links)
- A cooperative hyper-heuristic search framework (Q604941) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- A multiobjective framework for heavily constrained examination timetabling problems (Q613763) (← links)
- Greedy scheduling with custom-made objectives (Q613772) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← 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)
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables (Q958431) (← links)
- A university-timetabling problem and its solution using Benders' partitioning---a case study (Q964875) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution (Q992647) (← 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)
- Polynomial reduction of time-space scheduling to time scheduling (Q1028105) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
- A harmony search algorithm for university course timetabling (Q1761885) (← links)
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
- A new model for automated examination timetabling (Q1761908) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- Adaptive linear combination of heuristic orderings in constructing examination timetables (Q2255942) (← links)
- Hyper-heuristic approaches for the response time variability problem (Q2275609) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- Towards a practical engineering tool for rostering (Q2468743) (← links)
- A survey of metaheuristic-based techniques for university timetabling problems (Q2480804) (← links)
- AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm (Q3534665) (← links)
- Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems (Q4649212) (← links)