Name
Abstract | ||
|---|---|---|
Timetabling problems easily become hard due to their inherent combinatorial structure. In this work we investigate the examination timetabling problem for Universities. We step back and analyze the best known variant of the problem, the Uncapacitated Examination Timetabling Problem (UETP). In the process we unmask some properties of the UETP. Firstly, we detect components that can be used for deco... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/SEEDA-CECNSM53056.2021.9566258 | 2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM) |
Keywords | DocType | ISBN |
scheduling,bounds,examination timetabling,symmetry breaking | Conference | 978-1-6654-2742-5 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christos Gogos | 1 | 80 | 6.25 |
| Angelos Dimitsas | 2 | 0 | 0.34 |
| Vasileios Nastos | 3 | 0 | 0.34 |
| Christos Valouxis | 4 | 85 | 5.88 |