|
|
|
|
|
 |
Search published articles |
 |
|
Showing 1 results for Branch and Cut Method
Dr Mostafa Khorramizadeh,
Volume 13, Issue 1 (6-2022)
Abstract
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.
|
|
|
|
|
|
|
|
|
