The following pages link to The combinatorics of timetabling (Q1278524):
Displaying 31 items.
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling (Q284406) (← links)
- Operational research in education (Q319179) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- An introduction to timetabling (Q759645) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
- Disjoint congruence classes and a timetabling application (Q1026128) (← links)
- A large scale timetabling problem (Q1112719) (← links)
- An existential problem of a weight-controlled subset and its application to school timetable construction (Q1115806) (← links)
- Modeling and solving a real-life assignment problem at universities (Q1303567) (← links)
- A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481) (← links)
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. (Q1417487) (← links)
- An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- A cellular memetic algorithm for the examination timetabling problem (Q1652614) (← links)
- A comparative study of modern heuristics on the school timetabling problem (Q1736706) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- Efficient solutions for a university timetabling problem through integer programming (Q1887870) (← links)
- Time-tables, polyhedra and the greedy algorithm (Q1917272) (← links)
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy (Q2085509) (← links)
- An application of edge coloring of graphs to a class scheduling problem (Q2749408) (← links)
- Reconstructing a binary matrix under timetabling constraints (Q3439178) (← links)
- (Q4660318) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Programação da grade de horário em escolas de ensino fundamental e médio (Q4905620) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Implementation of a university course and examination timetabling system (Q5932035) (← links)
- Solution of the Meeting Time Choice Problem for n Persons (Q6063705) (← links)
