Hill-climbing search and branch-and-bound are two heuristic search algorithms used in artificial intelligence. What is the difference between these two approaches?

Edit
Report