Benders decomposition for curriculum-based course timetabling
From MaRDI portal
Publication:1652557
DOI10.1016/j.cor.2017.10.009zbMath1391.90238OpenAlexW2765712836MaRDI QIDQ1652557
Matias Sørensen, Niels-Christian F. Bagger, Thomas Riis Stidsen
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/12a2d9f7-2d9a-4ec6-a7c0-1618172d60db
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
High quality timetables for Italian schools ⋮ A traditional Benders' approach to sports timetabling ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks
Uses Software
Cites Work
- Unnamed Item
- A new lower bound for curriculum-based course timetabling
- Decomposition, reformulation, and diving in university course timetabling
- Partitioning procedures for solving mixed-variables programming problems
- 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
- Generalized Benders decomposition
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
- Comments on: ``An overview of curriculum-based course timetabling
This page was built for publication: Benders decomposition for curriculum-based course timetabling
