Weighted graphs and university course timetabling

DOI10.1016/0305-0548(92)90059-EzbMath0825.90529OpenAlexW2077257624MaRDI QIDQ1185992

Lynn Kiaer, Jay E. Yellen

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90059-e

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

A supernodal formulation of vertex colouring with applications in course timetabling ⋮ A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. ⋮ The design and implementation of an interactive course-timetabling system ⋮ Linear combinations of heuristics for examination timetabling

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Timetabling problem for university as assignment of activities to resources
• A classroom/time assignment model
• Chromatic optimisation: Limitations, objectives, uses, references
• A Lagrangean Relaxation Approach to Course Timetabling
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• New methods to color the vertices of a graph
• Scheduling to Minimize Interaction Cost
• On reconstruction of graphs

This page was built for publication: Weighted graphs and university course timetabling