Curriculum based course timetabling: new solutions to Udine benchmark instances
From MaRDI portal
Publication:1761906
DOI10.1007/s10479-010-0700-7zbMath1251.90160OpenAlexW2020250274MaRDI QIDQ1761906
Marco E. Lübbecke, Gerald Lach
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0700-7
Related Items (30)
Fairness in academic course timetabling ⋮ Adaptive tabu search for course timetabling ⋮ A new lower bound for curriculum-based course timetabling ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ Integer programming methods for large-scale practical classroom assignment problems ⋮ Benders decomposition for curriculum-based course timetabling ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ Integer programming for the generalized high school timetabling problem ⋮ Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ The maximum-impact coloring polytope ⋮ Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Answer set programming as a modeling language for course timetabling ⋮ Unnamed Item ⋮ Decomposition of university course timetabling. A systematic study of subproblems and their complexities ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ A strategic view of university timetabling ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem ⋮ Flow formulations for curriculum-based course timetabling ⋮ Facet-generating procedures for the maximum-impact coloring polytope ⋮ Facet-generating procedures for the maximum-impact coloring polytope ⋮ Comments on: ``An overview of curriculum-based course timetabling ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ An overview of curriculum-based course timetabling ⋮ The multiphase course timetabling problem
Uses Software
Cites Work
- Unnamed Item
- SCIP: solving constraint integer programs
- Application of a real-world university-course timetabling model solved by integer programming
- Matching theory
- An integer programming formulation for a case study in university timetabling.
- Recent research directions in automated timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Efficient solutions for a university timetabling problem through integer programming
- ITC2007 solver description: a hybrid approach
- Neighborhood portfolio approach for local search applied to timetabling problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
This page was built for publication: Curriculum based course timetabling: new solutions to Udine benchmark instances
