Strong bounds with cut and column generation for class-teacher timetabling
type: Item
instance of: scholarly article
title: Strong bounds with cut and column generation for class-teacher timetabling
zbMATH Open document ID: 1251.90183
author: Eduardo Uchoa
author: Luiz S. Ochi
author: Haroldo G. Santos
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6107421
zbMATH Keywords: integer programming
zbMATH Keywords: timetabling
zbMATH Keywords: column generation
zbMATH Keywords: cut generation
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W2004417381
cites work: Constructing Good Solutions for the Spanish School Timetabling Problem
cites work: A computational study of exact knapsack separation for the generalized assignment problem
cites work: Computational experience with general cutting planes for the set covering problem
cites work: A computational study of a cutting plane algorithm for university course timetabling
cites work: Facets of the knapsack polytope
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Fenchel Cutting Planes for Integer Programs
cites work: Solving \(0/1\) integer programs with enumeration cutting planes
cites work: Metaheuristics for high school timetabling
cites work: A tabu search algorithm for computing an operational timetable
cites work: Decomposition Principle for Linear Programs
cites work: An integer programming formulation for a case study in university timetabling.
cites work: Q2771657
cites work: Distribution requirements and compactness constraints in school timetabling
cites work: Combinatorial Optimization Problems with Soft and Hard Requirements
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q5518886
cites work: Facet of regular 0–1 polytopes
cites work: Tabu search for large scale timetabling problems
cites work: A column generation approach for the timetabling problem of Greek high schools
cites work: A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
cites work: Faces for a linear inequality in 0–1 variables
DOI: 10.1007/S10479-010-0709-Y
Recommended article: A generalized class-teacher model for some timetabling problems
Recommended article: Formulation space search approach for the teacher/class timetabling problem
Recommended article: A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
Recommended article: A new lower bound for curriculum-based course timetabling
Recommended article: A computational study of a cutting plane algorithm for university course timetabling
Recommended article: A column generation approach for solving the examination-timetabling problem
Recommended article: A column generation approach to high school timetabling modeled as a multicommodity flow problem
Recommended article: Q3095714
Recommended article: A column generation approach for the timetabling problem of Greek high schools
Recommended article: Educational timetabling: problems, benchmarks, and state-of-the-art results
description: scientific article; zbMATH DE number 6107421