Multiple-retrieval case-based reasoning for course timetabling problems
From MaRDI portal
Recommendations
Cited in
(14)- A university-timetabling problem and its solution using Benders' partitioning---a case study
- scientific article; zbMATH DE number 1727365 (Why is no real title available?)
- AUTOMATED LECTURE TIMETABLING USING A MEMETIC ALGORITHM
- Case-based heuristic selection for timetabling problems
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Operational research in education
- Developing compact course timetables with optimized student flows
- Adaptive tabu search for course timetabling
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
- A graph-based hyper-heuristic for educational timetabling problems
- Polynomial reduction of time-space scheduling to time scheduling
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Multiagent cooperative learning strategies for pursuit-evasion games
- A decomposed metaheuristic approach for a real-world university timetabling problem
This page was built for publication: Multiple-retrieval case-based reasoning for course timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200786)