Open access
Aug 2026
A comparative study of heuristic and exact algorithms: the case of cheapest insertion heuristic and branch and bound algorithm
The comparison suggests that CIH is more suitable for large-scale problems requiring quick solutions, whereas B&B is preferable when obtaining the optimal solution is essential, despite its higher computational cost and longer execution time.
Shams Abdulkareem, W. Elaibi
· Journal of university of Anb... · 0 citations