On the performance of scatter search for post-enrolment course timetabling problems
From MaRDI portal
Publication:2015784
Recommendations
Cites work
- scientific article; zbMATH DE number 1962002 (Why is no real title available?)
- scientific article; zbMATH DE number 2013445 (Why is no real title available?)
- scientific article; zbMATH DE number 2159379 (Why is no real title available?)
- scientific article; zbMATH DE number 2209663 (Why is no real title available?)
- A survey of metaheuristic-based techniques for university timetabling problems
- A survey of search methodologies and automated system development for examination timetabling
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- A time-predefined approach to course timetabling
- An effective hybrid algorithm for university course timetabling
- An improved ant colony optimisation heuristic for graph colouring
- Context-independent scatter and tabu search for permutation problems
- Evolutionary Computation in Combinatorial Optimization
- Hybrid metaheuristics: an introduction
- ITC2007 solver description: a hybrid approach
- Introduction to evolutionary computing
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Local search and lower bounds for the patient admission scheduling problem
- Metaheuristics for university course timetabling
- Metaheuristics. From design to implementation.
- Neighborhood portfolio approach for local search applied to timetabling problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- Principles of scatter search
- Scatter search. Methodology and implementation in C. With CD-ROM.
Cited in
(3)
This page was built for publication: On the performance of scatter search for post-enrolment course timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015784)