Penalising Patterns in Timetables: Novel Integer Programming Formulations

DOI10.1007/978-3-540-77903-2_63zbMath1209.90160OpenAlexW1534308429WikidataQ57968727 ScholiaQ57968727MaRDI QIDQ5391956

Jakub Mareček, Hana Rudová, Andrew J. Parkes, Edmund Kieran Burke

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_63

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items

Benders decomposition for curriculum-based course timetabling ⋮ Integer programming for minimal perturbation problems in university course timetabling ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Computational models for timetabling problem ⋮ Quality recovering of university timetables ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based 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 ⋮ Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem ⋮ Flow formulations for curriculum-based course timetabling ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ An overview of curriculum-based course timetabling

Uses Software

• SCIP