|
|
|
|
|
 |
Search published articles |
 |
|
Showing 2 results for Branch and Cut
Dr. Mostafa Khorramzadeh, Dr Roghayeh Javvi,
Volume 12, Issue 1 (6-2021)
Abstract
This paper is concerned with presenting an exact algorithm for the Undirected Profitable Location Rural Postman Problem. This problem combines the profitable rural postman and facility location problems and also has some interesting real-life applications. Fixed costs are associated with end points of each profitable edge and the objective is to choose a subset of profitable edges such that the difference between the profit collected and the cost of opening facilities and traveling cost is maximized. A dominance relation is used to present an integer programming formulation for the problem and a branch and cut algorithm is developed for solving the problem and extensive numerical results on real-world benchmark instances are given to evaluate the quality of presented algorithms.
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.
|
|
|
|
|
|
|
|
|
