Formulation space search approach for the teacher/class timetabling problem
From MaRDI portal
Recommendations
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
- School timetabling problem
- A computational study of local search algorithms for Italian high-school timetabling
- The combinatorics of timetabling
- A tabu search algorithm for assigning teachers to courses.
Cited in
(12)- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Strong bounds with cut and column generation for class-teacher timetabling
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- A note on solving MINLP's using formulation space search
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Variable neighborhood search based algorithms for high school timetabling
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem
- Local search with an exponential neighborhood for the servers load balancing problem
- Subcost-guided search -- experiments with timetabling problems
- A heuristic for the circle packing problem with a variety of containers
This page was built for publication: Formulation space search approach for the teacher/class timetabling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3649277)
