Weighted graphs and university course timetabling

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/0305-0548(92)90059-E" rel="nofollow">DOI 10.1016/0305-0548(92)90059-E</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/0825.90529" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2077257624" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q1185992" rel="nofollow">MaRDI QID Q1185992</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q1185992" rel="nofollow">FDO</a>

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

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 42739 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Lagrangean Relaxation Approach to Course Timetabling
• A classroom/time assignment model
• An introduction to timetabling
• Chromatic optimisation: Limitations, objectives, uses, references
• Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
• New methods to color the vertices of a graph
• On reconstruction of graphs
• Scheduling to Minimize Interaction Cost
• Timetabling problem for university as assignment of activities to resources

Cited in

(4)

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

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)