Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results

DOI10.1007/s10479-010-0707-0zbMath1251.90117MaRDI QIDQ1761890

Luca Di Gaspero, Alex Bonutti, Fabio De Cesco

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0707-0

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Answer set programming as a modeling language for course timetabling, Comments on: ``An overview of curriculum-based course timetabling, XHSTT: an XML archive for high school timetabling problems in different countries, A branch-and-cut procedure for the Udine course timetabling problem, Towards a reference model for timetabling and rostering, Curriculum based course timetabling: new solutions to Udine benchmark instances, An overview of curriculum-based course timetabling, Adaptive tabu search for course timetabling, Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

Uses Software

• DIMACS

Cites Work

• A survey of search methodologies and automated system development for examination timetabling
• A computational study of a cutting plane algorithm for university course timetabling
• An integer programming formulation for a case study in university timetabling.
• Neighborhood portfolio approach for local search applied to timetabling problems
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Penalising Patterns in Timetables: Novel Integer Programming Formulations
• Unnamed Item
• Unnamed Item
• Unnamed Item