Pages that link to "Item:Q1331550"
From MaRDI portal
The following pages link to A tabu search algorithm for computing an operational timetable (Q1331550):
Displaying 35 items.
- Operational research in education (Q319179) (← links)
- Elective course planning (Q420895) (← links)
- Computational models for timetabling problem (Q478951) (← links)
- A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- Case-based heuristic selection for timetabling problems (Q880536) (← links)
- Automorphism groups of \(q\)-trigonal planar Klein surfaces and maximal surfaces (Q1030024) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- Distribution requirements and compactness constraints in school timetabling (Q1291590) (← links)
- Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← links)
- The course scheduling problem at Lufthansa technical training (Q1303529) (← links)
- Modeling and solving a real-life assignment problem at universities (Q1303567) (← links)
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. (Q1417487) (← links)
- Using tabu search with longer-term memory and relaxation to create examination timetables. (Q1417490) (← links)
- An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
- Constraint programming approach for school timetabling. (Q1422351) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- Scheduling sports competitions on multiple venues. (Q1810517) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- The analytic hierarchy process and multiobjective 0--1 faculty course assignment (Q1877058) (← links)
- Efficient solutions for a university timetabling problem through integer programming (Q1887870) (← links)
- HORES: A timetabling system for Spanish secondary schools (Q1919110) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study (Q2225651) (← links)
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
- On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← links)
- A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Towards constraint-based school timetabling (Q2468741) (← links)
- A survey of metaheuristic-based techniques for university timetabling problems (Q2480804) (← links)
- Mathematical programming models and algorithms for a class--faculty assignment problem (Q2496072) (← links)
- Programação da grade de horário em escolas de ensino fundamental e médio (Q4905620) (← links)
- An integer program and a hybrid genetic algorithm for the university timetabling problem (Q5268943) (← links)
- Implementation of a university course and examination timetabling system (Q5932035) (← links)