Strong bounds with cut and column generation for class-teacher timetabling

DOI10.1007/s10479-010-0709-yzbMath1251.90183OpenAlexW2004417381MaRDI QIDQ1761917

Luiz Satoru Ochi, Eduardo Uchoa, Haroldo Gambini Santos

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.717.4184

zbMATH Keywords

integer programmingcolumn generationtimetablingcut generation

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (22)

The consultation timetabling problem at Danish high schools ⋮ GOAL solver: a hybrid local search based solver for high school timetabling ⋮ Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ Late acceptance hill-climbing for high school timetabling ⋮ Operational research in education ⋮ Developing compact course timetables with optimized student flows ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ Variable neighborhood search based algorithms for high school timetabling ⋮ maxSAT-based large neighborhood search for high school timetabling ⋮ Modeling high school timetabling with bitvectors ⋮ Parallel local search algorithms for high school timetabling problems ⋮ High quality timetables for Italian schools ⋮ Generating class schedules within a complex modular environment with application to secondary schools ⋮ Integer programming for the generalized high school timetabling problem ⋮ An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department ⋮ Practices in timetabling in higher education institutions: a systematic review ⋮ Unnamed Item ⋮ A column generation approach to high school timetabling modeled as a multicommodity flow problem ⋮ Integer programming techniques for educational timetabling ⋮ An assignment problem and its application in education domain: a review and potential path ⋮ A SA-VNS approach for the High School Timetabling Problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Tabu search for large scale timetabling problems
• A computational study of a cutting plane algorithm for university course timetabling
• A computational study of exact knapsack separation for the generalized assignment problem
• Computational experience with general cutting planes for the set covering problem
• Distribution requirements and compactness constraints in school timetabling
• A tabu search algorithm for computing an operational timetable
• Solving \(0/1\) integer programs with enumeration cutting planes
• Metaheuristics for high school timetabling
• An integer programming formulation for a case study in university timetabling.
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Combinatorial Optimization Problems with Soft and Hard Requirements
• A column generation approach for the timetabling problem of Greek high schools
• Decomposition Principle for Linear Programs
• A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• On the Complexity of Timetable and Multicommodity Flow Problems
• Fenchel Cutting Planes for Integer Programs
• Constructing Good Solutions for the Spanish School Timetabling Problem

This page was built for publication: Strong bounds with cut and column generation for class-teacher timetabling