A computational study of a cutting plane algorithm for university course timetabling

DOI10.1007/s10951-005-4780-1zbMath1123.90016OpenAlexW2135942405MaRDI QIDQ880517

Pasquale Avella, Igor' Leonidovich Vasilyev

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-4780-1

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (19)

Integer programming techniques for the nurse rostering problem ⋮ A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems ⋮ School timetabling for quality student and teacher schedules ⋮ A MILP model for the teacher assignment problem considering teachers' preferences ⋮ Integer programming methods for large-scale practical classroom assignment problems ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Computational models for timetabling problem ⋮ Unnamed Item ⋮ A branch and cut heuristic for a runway scheduling problem ⋮ Integer programming techniques for educational timetabling ⋮ Timetabling problems at the TU Eindhoven ⋮ Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ Term-end exam scheduling at United States Military Academy/West Point ⋮ Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ An overview of curriculum-based course timetabling ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences

Uses Software

• Hyperheuristics
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• The combinatorics of timetabling
• The teacher assignment problem: A special case of the fixed charge transportation problem
• Geometric algorithms and combinatorial optimization.
• An exact algorithm for the maximum stable set problem
• The relation of time indexed formulations of single machine scheduling problems to the node packing problem
• An integer programming formulation for a case study in university timetabling.
• Set packing relaxations of some integer programs
• Recent research directions in automated timetabling
• Complexity of some special types of timetabling problems
• A linear algorithm for computing the optimum university timetable
• School Timetabling—A Case in Large Binary Integer Linear Programming
• A Lagrangian Relaxation Approach To The Classroom Assignment Problem^*
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Timetabling for Greek high schools
• On the facial structure of set packing polyhedra
• Implementation of a university course and examination timetabling system
• Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers

This page was built for publication: A computational study of a cutting plane algorithm for university course timetabling