A university-timetabling problem and its solution using Benders' partitioning---a case study
type: Item
instance of: scholarly article
title: A university-timetabling problem and its solution using Benders' partitioning---a case study
zbMATH Open document ID: 1184.90097
author: Yuqiang Wang
author: Amrusha Varadarajan
author: Subhash C. Sarin
published in: Journal of Scheduling
publication date: 2010-04-21T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5696515
zbMATH Keywords: timetabling
zbMATH Keywords: Benders' partitioning
zbMATH Keywords: integer program
describes a project that uses: Hyperheuristics
MaRDI profile type: Publication
full work available at URL: s10951-009-0157-1
OpenAlex ID: W2155918027
cites work: Design and implementation of a course scheduling system using Tabu Search
cites work: Mathematical programming models and algorithms for a class--faculty assignment problem
cites work: A large scale timetabling problem
cites work: A two-stage multiobjective scheduling model for [faculty-course-time] assignments
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Timetabling for Greek high schools
cites work: Recent research directions in automated timetabling
cites work: Q2779805
cites work: Q2781959
cites work: Multiple-retrieval case-based reasoning for course timetabling problems
cites work: A graph-based hyper-heuristic for educational timetabling problems
cites work: Q2779797
cites work: Q2779802
cites work: An integer programming formulation for a case study in university timetabling.
cites work: University timetabling by constraint-based reasoning: A case study
cites work: Implementation of a university course and examination timetabling system
cites work: A computational approach to enhancing course timetabling with integer programming
cites work: A column generation approach for the timetabling problem of Greek high schools
cites work: School Timetabling—A Case in Large Binary Integer Linear Programming
cites work: Timetabling problems at the TU Eindhoven
DOI: 10.1007/S10951-009-0157-1
description: scientific article; zbMATH DE number 5696515