Revisiting local search for curriculum-based course timetabling
From MaRDI portal
Cites work
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- A new lower bound for curriculum-based course timetabling
- A supernodal formulation of vertex colouring with applications in course timetabling
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Adaptive tabu search for course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Benders decomposition for curriculum-based course timetabling
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Curriculum-based course timetabling with SAT and MaxSAT
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- Fairness in academic course timetabling
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Flow formulations for curriculum-based course timetabling
- ITC2007 solver description: a hybrid approach
- Optimization by simulated annealing
- Revisiting simulated annealing: a component-based analysis
- Setting the research agenda in automated timetabling: the second international timetabling competition
This page was built for publication: Revisiting local search for curriculum-based course timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349535)
