Penalising patterns in timetables: novel integer programming formulations

DOI10.1007/978-3-540-77903-2_63MaRDI QIDQ5391956zbMATH OpenOpenAlexWikidataFDO

Authors Jakub Mareček, Andrew J. Parkes, Hana Rudová, Edmund K. 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

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

Recommendations

• The combinatorics of timetabling
• A computational approach to enhancing course timetabling with integer programming
• An introduction to timetabling
• Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
• An integer programming formulation for a case study in university timetabling.

Cited in

(15)

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

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Penalising patterns in timetables: novel integer programming formulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391956)