|
Applying Branch and Cut Method to a Graph Based Reduction of UCTP
|
Mostafa Khorramizadeh*    |
| Shiraz University of Technology, Iran ، m.khorrami@sutech.ac.ir |
|
|
چکیده: (1363 مشاهده) |
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.
|
|
| |
|
|
متن کامل [PDF 966 kb]
(5163 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Mathematical Modeling and Applications of OR
دریافت: 1401/11/18 | پذیرش: 1401/3/9 | انتشار: 1401/3/9
|
|
|
|
|
|
|
| ارسال پیام به نویسنده مسئول |
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
