A two-stage decomposition of high school timetabling applied to cases in Denmark
From MaRDI portal
Publication:336881
DOI10.1016/j.cor.2013.08.025zbMath1348.90313OpenAlexW1985195201MaRDI QIDQ336881
Matias Sørensen, Florian H. W. Dahms
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/60438370-2dfb-442a-8de6-caa372c4f94c
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
Effective learning hyper-heuristics for the course timetabling problem ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ maxSAT-based large neighborhood search for high school timetabling ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ Modeling high school timetabling with bitvectors ⋮ Parallel local search algorithms for high school timetabling problems ⋮ High quality timetables for Italian schools ⋮ Integer programming for the generalized high school timetabling problem ⋮ A multi-objective mixed integer linear programming model for thesis defence scheduling ⋮ Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ The multiphase course timetabling problem
Cites Work
- Unnamed Item
- Unnamed Item
- The third international timetabling competition
- An introduction to timetabling
- School timetabling for quality student and teacher schedules
- A computational study of local search algorithms for Italian high-school timetabling
- Decomposition, reformulation, and diving in university course timetabling
- A two-stage multiobjective scheduling model for [faculty-course-time assignments]
- An integer programming formulation for a case study in university timetabling.
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- An XML format for benchmarks in high school timetabling
- Strong bounds with cut and column generation for class-teacher timetabling
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Efficient solutions for a university timetabling problem through integer programming
- A computational approach to enhancing course timetabling with integer programming
- The perfectly matchable subgraph polytope of a bipartite graph
- A column generation approach for the timetabling problem of Greek high schools
- Timetabling for Greek high schools
- Maximum matching and a polyhedron with 0,1-vertices
- Implementation of a university course and examination timetabling system
This page was built for publication: A two-stage decomposition of high school timetabling applied to cases in Denmark
