Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
From MaRDI portal
Publication:1991148
DOI10.1016/j.ejor.2018.06.042zbMath1403.90302OpenAlexW2809692794WikidataQ129589251 ScholiaQ129589251MaRDI QIDQ1991148
Thomas Riis Stidsen, Niels-Christian F. Bagger, Matias Sørensen
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://backend.orbit.dtu.dk/ws/files/150862346/MELJU_1_s2.0_S0377221718305794_main.pdf
Related Items (2)
Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ The multiphase course timetabling problem
Uses Software
Cites Work
- Unnamed Item
- A new lower bound for curriculum-based course timetabling
- Curriculum-based course timetabling with SAT and MaxSAT
- A supernodal formulation of vertex colouring with applications in course timetabling
- Decomposition, reformulation, and diving in university course timetabling
- Local branching
- 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
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
- A Primer in Column Generation
- Algorithm 457: finding all cliques of an undirected graph
- On cliques in graphs
- Comments on: ``An overview of curriculum-based course timetabling
This page was built for publication: Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
