Weighted graphs and university course timetabling
DOI10.1016/0305-0548(92)90059-EzbMATH Open0825.90529OpenAlexW2077257624MaRDI QIDQ1185992FDOQ1185992
Authors: Lynn Kiaer, Jay 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
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- New methods to color the vertices of a graph
- A Lagrangean Relaxation Approach to Course Timetabling
- An introduction to timetabling
- Title not available (Why is that?)
- Scheduling to Minimize Interaction Cost
- On reconstruction of graphs
- A classroom/time assignment model
- Chromatic optimisation: Limitations, objectives, uses, references
- Timetabling problem for university as assignment of activities to resources
- Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
Cited In (4)
- A supernodal formulation of vertex colouring with applications in course timetabling
- The design and implementation of an interactive course-timetabling system
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- Linear combinations of heuristics for examination timetabling
This page was built for publication: Weighted graphs and university course timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185992)
