A branch-and-cut procedure for the Udine course timetabling problem
type: Item
instance of: scholarly article
title: A branch-and-cut procedure for the Udine course timetabling problem
zbMATH Open document ID: 1251.90276
author: Jakub Mareček
author: Andrew J. Parkes
author: Edmund K. Burke
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6107402
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut
zbMATH Keywords: cutting planes
zbMATH Keywords: soft constraints
zbMATH Keywords: educational timetabling
zbMATH Keywords: university course timetabling
describes a project that uses: CPLEX
describes a project that uses: Cliquer
MaRDI profile type: Publication
full work available at URL: s10479-010-0828-5
OpenAlex ID: W2010360426
Wikidata QID: Q57968679
cites work: Q3056948
cites work: A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
cites work: A computational study of a cutting plane algorithm for university course timetabling
cites work: On unions and dominants of polytopes
cites work: Linear-time separation algorithms for the three-index assignment polytope
cites work: Facets of the three-index assignment polytope
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Towards improving the utilization of university teaching space
cites work: Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
cites work: Recent research directions in automated timetabling
cites work: A supernodal formulation of vertex colouring with applications in course timetabling
cites work: Penalising Patterns in Timetables: Novel Integer Programming Formulations
cites work: Decomposition, reformulation, and diving in university course timetabling
cites work: Cliques, holes and the vertex coloring polytope
cites work: Properties of some ILP formulations of a class of partitioning problems
cites work: A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Facets of the graph coloring polytope
cites work: Q2934691
cites work: An integer programming formulation for a case study in university timetabling.
cites work: Efficient solutions for a university timetabling problem through integer programming
cites work: An automated university course timetabling system developed in a distributed environment: a case study.
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Brick decompositions and the matching rank of graphs
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: Q4033689
cites work: Curriculum based course timetabling: new solutions to Udine benchmark instances
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: A cutting plane algorithm for graph coloring
cites work: A computational approach to enhancing course timetabling with integer programming
cites work: ITC2007 solver description: a hybrid approach
cites work: Application of a real-world university-course timetabling model solved by integer programming
cites work: The worst-case time complexity for generating all maximal cliques and computational experiments
cites work: School Timetabling—A Case in Large Binary Integer Linear Programming
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
cites work: A branch-and-cut algorithm for graph coloring
cites work: Q3002782
DOI: 10.1007/S10479-010-0828-5
description: scientific article; zbMATH DE number 6107402