Decomposition, reformulation, and diving in university course timetabling
From MaRDI portal
Publication:1038298
DOI10.1016/j.cor.2009.02.023zbMath1173.90451arXiv0903.1095OpenAlexW2070313595WikidataQ57968714 ScholiaQ57968714MaRDI QIDQ1038298
Jakub Mareček, Hana Rudová, Andrew J. Parkes, Edmund Kieran Burke
Publication date: 17 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.1095
integer programmingdecompositionheuristicmetaheuristicuniversity course timetablingreformulationsoft constraintsdiving
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items
Developing compact course timetables with optimized student flows ⋮ A new lower bound for curriculum-based course timetabling ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ Integer programming methods for large-scale practical classroom assignment problems ⋮ Benders decomposition for curriculum-based course timetabling ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ A multi-objective mixed integer linear programming model for thesis defence scheduling ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Answer set programming as a modeling language for course timetabling ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course 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 ⋮ A new model for curriculum-based university course timetabling ⋮ Flow formulations for curriculum-based course timetabling ⋮ Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system ⋮ An overview of curriculum-based course timetabling ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences ⋮ The multiphase course timetabling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Equitable colorings of bounded treewidth graphs
- A general heuristic for vehicle routing problems
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A computational study of a cutting plane algorithm for university course timetabling
- A computational study of local search algorithms for Italian high-school timetabling
- Application of a real-world university-course timetabling model solved by integer programming
- An integer programming formulation for a case study in university timetabling.
- An automated university course timetabling system developed in a distributed environment: a case study.
- Local branching
- Recent research directions in automated timetabling
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Efficient solutions for a university timetabling problem through integer programming
- Record breaking optimization results using the ruin and recreate principle
- A computational approach to enhancing course timetabling with integer programming
- An improved algorithm for solving biobjective integer programs
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Vehicle routing problem with elementary shortest path based column generation
- Decomposition and dynamic cut generation in integer linear programming
- Neighborhood portfolio approach for local search applied to timetabling problems
- A taxonomy of evolutionary algorithms in combinatorial optimization
- The feasibility pump
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Towards improving the utilization of university teaching space
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On the Complexity of Timetable and Multicommodity Flow Problems
- The reformulation of two mixed integer programming problems
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Heuristics of the Branch-Cut-and-Price-Framework SCIP
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
- Formulations and Reformulations in Integer Programming
- Computer Solutions of the Traveling Salesman Problem
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Evolutionary Multi-Criterion Optimization
