Pages that link to "Item:Q2432892"
From MaRDI portal
The following pages link to A graph-based hyper-heuristic for educational timetabling problems (Q2432892):
Displaying 50 items.
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- Fairness in academic course timetabling (Q284412) (← links)
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Operational research in education (Q319179) (← links)
- An iterated multi-stage selection hyper-heuristic (Q322405) (← links)
- A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- 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)
- Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
- Advancing Shannon entropy for measuring diversity in systems (Q1722720) (← links)
- Practices in timetabling in higher education institutions: a systematic review (Q1730752) (← links)
- Automated generation of constructive ordering heuristics for educational timetabling (Q1730754) (← links)
- Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system (Q1752832) (← links)
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics (Q1753518) (← 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)
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties (Q2116843) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- Metaheuristics ``In the large'' (Q2242238) (← links)
- Adaptive linear combination of heuristic orderings in constructing examination timetables (Q2255942) (← links)
