Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem

DOI10.1007/s10951-018-0582-0zbMath1427.90131OpenAlexW2527830873WikidataQ129352613 ScholiaQ129352613MaRDI QIDQ2281613

Niels-Christian F. Bagger, Guy Desaulniers, Jacques Desrosiers

Publication date: 3 January 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://backend.orbit.dtu.dk/ws/files/164675173/DantzigWolfeDecomposition.pdf

zbMATH Keywords

integer programmingvalid inequalitiescourse timetablingpreprocessing

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Unnamed Item ⋮ The multiphase course timetabling problem

Uses Software

• SCIP
• Gurobi
• Algorithm 457

Cites Work

• Unnamed Item
• A new lower bound for curriculum-based course timetabling
• A supernodal formulation of vertex colouring with applications in course timetabling
• SCIP: solving constraint integer programs
• A computational study of a cutting plane algorithm for university course timetabling
• Decomposition, reformulation, and diving in university course 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
• An overview of curriculum-based course timetabling
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Penalising Patterns in Timetables: Novel Integer Programming Formulations
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem