A 0-1 integer programming approach to a university timetabling problem
From MaRDI portal
Publication:3545768
zbMATH Open1153.90412MaRDI QIDQ3545768FDOQ3545768
Authors:
Publication date: 11 December 2008
Recommendations
- An integer programming formulation for a case study in university timetabling.
- A computational approach to enhancing course timetabling with integer programming
- Implementation of a university course and examination timetabling system
- Computational models for timetabling problem
- scientific article; zbMATH DE number 7529792
Cited In (16)
- Integer programming for minimal perturbation problems in university course timetabling
- New integer linear programming approaches for course timetabling
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences
- Implementation of a university course and examination timetabling system
- Computational models for timetabling problem
- Application of a real-world university-course timetabling model solved by integer programming
- An integer programming formulation for a case study in university timetabling.
- Efficient solutions for a university timetabling problem through integer programming
- Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences
- On a conjecture for the university timetabling problem
- Mixed integer linear programming models for university timetabling and its application
- A goal programming model for timetable scheduling
- A timetabling system for scheduling courses of statistics and data science: methodology and case study
- Schedules and Waitlists and Integer Programs, Oh My!
This page was built for publication: A 0-1 integer programming approach to a university timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545768)