School Timetabling—A Case in Large Binary Integer Linear Programming
From MaRDI portal
Recommendations
- Timetabling for Greek high schools
- A computational approach to enhancing course timetabling with integer programming
- An integer programming formulation for a case study in university timetabling.
- Efficient solutions for a university timetabling problem through integer programming
- A 0-1 integer programming approach to a university timetabling problem
Cited in
(36)- Decomposition, reformulation, and diving in university course timetabling
- A large scale timetabling problem
- On the calculation of true and pseudo penalties in multiple choice integer programming
- Modelling and solving an acyclic multi-period timetabling problem
- Exchanges procedures for timetabling problems
- Computerised decision aid for timetabling --- a case analysis
- Computational comparison on the partitioning strategies in multiple choice integer programming
- The course scheduling problem at Lufthansa technical training
- Modeling and solving a real-life assignment problem at universities
- A tabu search algorithm for computing an operational timetable
- Covering the classroom requirements for the schools of Hamburg
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- An integer programming formulation for a case study in university timetabling.
- A branch-and-cut procedure for the Udine course timetabling problem
- Efficient solutions for a university timetabling problem through integer programming
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences
- The consultation timetabling problem at Danish high schools
- A computational approach to enhancing course timetabling with integer programming
- New integer linear programming approaches for course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Investigation of data regularization and optimization of timetables by Lithuanian high schools example
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- Variable neighborhood search based algorithms for high school timetabling
- Integer programming methods for large-scale practical classroom assignment problems
- Mathematical models and algorithms for a high school timetabling problem
- Elective course planning
- Lagrangian heuristics for instructor scheduling in executive development programmes
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences
- Term-end exam scheduling at United States Military Academy/West Point
- Double parametric scheme based multi-objective university course scheduling problem by fuzzy programming technique with exponential membership function
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A computational study of a cutting plane algorithm for university course timetabling
- A university-timetabling problem and its solution using Benders' partitioning---a case study
This page was built for publication: School Timetabling—A Case in Large Binary Integer Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217921)
