A linear algorithm for computing the optimum university timetable
From MaRDI portal
Cited in
(6)- An integer programming formulation for a case study in university timetabling.
- A new model for curriculum-based university course timetabling
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- Distributed algorithms for maximum cliques
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- A computational study of a cutting plane algorithm for university course timetabling
This page was built for publication: A linear algorithm for computing the optimum university timetable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3214391)