Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
From MaRDI portal
Publication:3534665
DOI10.1007/978-3-540-85776-1_22zbMath1169.68608MaRDI QIDQ3534665
Publication date: 4 November 2008
Published in: Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85776-1_22
90C59: Approximation methods and heuristics in mathematical programming
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Unnamed Item
- An effective hybrid algorithm for university course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- ITC2007 solver description: a hybrid approach
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems