other Mathematical Modeling and Applications of OR Mathematical Modeling and Applications of OR پژوهشی Original <span style="font-size:11pt"><span style="line-height:normal"><span style="text-autospace:none"><span new="" roman="" style="font-family:" times=""><i><span style="font-size:10.0pt">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.</span></i></span></span></span></span><br> &nbsp; Integer Programming, University Course Timetabling, Branch and Cut Method, Binary Variables, Scheduling Problem 48 60 http://iors.ir/journal/browse.php?a_code=A-10-1422-57&slc_lang=other&sid=1 Mostafa Khorramizadeh Mostafa Khorramizadeh m.khorrami@sutech.ac.ir 1111111111 1111111111 Yes Shiraz University of Technology, Iran Shiraz University of Technology, Iran