A computational approach to enhancing course timetabling with integer programming
From MaRDI portal
Publication:2369205
DOI10.1016/j.amc.2005.07.039zbMath1092.90025OpenAlexW2062660149MaRDI QIDQ2369205
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.07.039
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items (9)
A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ Unnamed Item ⋮ A university-timetabling problem and its solution using Benders' partitioning---a case study ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ An overview of curriculum-based course timetabling ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences
Cites Work
- Tabu search for large scale timetabling problems
- Applied simulated annealing
- An integer programming formulation for a case study in university timetabling.
- A column generation approach for the timetabling problem of Greek high schools
- School Timetabling—A Case in Large Binary Integer Linear Programming
- A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
- An overview of heuristic solution methods
- Matrix reduction using the Hungarian method for the generation of school timetables
- Constructing Good Solutions for the Spanish School Timetabling Problem
This page was built for publication: A computational approach to enhancing course timetabling with integer programming
