Comments on: ``An overview of curriculum-based course timetabling
From MaRDI portal
Publication:5971109
DOI10.1007/s11750-015-0365-0zbMath1319.90038OpenAlexW2069658036MaRDI QIDQ5971109
Publication date: 27 July 2015
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0365-0
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Integer programming methods for large-scale practical classroom assignment problems
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Curriculum-based course timetabling with SAT and MaxSAT
- A supernodal formulation of vertex colouring with applications in course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Towards improving the utilization of university teaching space
- Answer set programming as a modeling language for course timetabling
This page was built for publication: Comments on: ``An overview of curriculum-based course timetabling
