A new lower bound for curriculum-based course timetabling

DOI10.1016/j.cor.2013.02.010zbMath1348.90245OpenAlexW2111019697MaRDI QIDQ336544

Alberto Caprara, Valentina Cacchiani, Roberto Roberti, Paolo Toth

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.010

zbMATH Keywords

column generationtimetablinglower bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Benders decomposition for curriculum-based course timetabling ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study ⋮ Quality recovering of university timetables ⋮ Unnamed Item ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ A strategic view of university timetabling ⋮ Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem ⋮ A new model for curriculum-based university course timetabling ⋮ Flow formulations for curriculum-based course timetabling ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ An overview of curriculum-based course timetabling

Cites Work

• A supernodal formulation of vertex colouring with applications in course timetabling
• Decomposition, reformulation, and diving in university course timetabling
• Recent research directions in automated timetabling
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• A branch-and-cut procedure for the Udine course timetabling problem
• Curriculum based course timetabling: new solutions to Udine benchmark instances
• A survey of metaheuristic-based techniques for university timetabling problems
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

This page was built for publication: A new lower bound for curriculum-based course timetabling