|
Applying Branch and Cut Method to a Graph Based Reduction of UCTP
|
Mostafa Khorramizadeh *    |
| Shiraz University of Technology, Iran , m.khorrami@sutech.ac.ir |
|
|
Abstract: (1195 Views) |
Here, we first associate a graph to a university course timetabling problem (UCTP) and use the components of this graph and some customary and organizational rules to transform the original large scale problem into some smaller problems. Then, we apply the branch and cut method to obtain the optimal solution of each smaller problem. Our presented approach enables us to apply exact methods to obtain high quality solutions for large scale UCTPs. Finally, we examine the numerical efficiency of the resulting algorithm.
|
|
| Keywords: Integer Programming, University Course Timetabling, Branch and Cut Method, Binary Variables, Scheduling Problem |
|
|
Full-Text [PDF 966 kb]
(4589 Downloads)
|
Type of Study: Original |
Subject:
Mathematical Modeling and Applications of OR
Received: 2023/02/7 | Accepted: 2022/05/30 | Published: 2022/05/30
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
