New integer linear programming approaches for course timetabling
type: Item
instance of: scholarly article
title: New integer linear programming approaches for course timetabling
zbMATH Open document ID: 1180.90197
author: Natashia Boland
author: Barry D. Hughes
author: Liam T. G. Merlot
author: Peter J. Stuckey
published in: Computers \& Operations Research
publication date: 2008-01-23T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5229649
zbMATH Keywords: blocking
MaRDI profile type: MaRDI publication profile
full work available at URL: j.cor.2006.10.016
OpenAlex ID: W2093436036
cites work: Recent research directions in automated timetabling
cites work: Assigning students to course sections using tabu search
cites work: Design and implementation of a course scheduling system using Tabu Search
cites work: A large scale timetabling problem
cites work: Q2779802
cites work: Tabu search for large scale timetabling problems
cites work: Constructing a course schedule by solving a series of assignment type problems
cites work: Computerised decision aid for timetabling --- a case analysis
cites work: Student centred school timetabling
cites work: Graph theory with applications
cites work: On Representatives of Subsets
cites work: Hybrid variable neighbourhood approaches to university exam timetabling
DOI: 10.1016/J.COR.2006.10.016
Recommended article: A computational approach to enhancing course timetabling with integer programming
Recommended article: A 0-1 integer programming approach to a university timetabling problem
Recommended article: Optimal block design models for course timetabling
Recommended article: School Timetabling—A Case in Large Binary Integer Linear Programming
Recommended article: An integer programming formulation for a case study in university timetabling.
description: scientific article; zbMATH DE number 5229649