Branch and Bound
When solving hard combinatorial problems, Backtracking provides an exact solution by executing a systematic Depth-First Search (DFS). However, it does so blindly, relying entirely on hitting an unfeasible boundary before turning around.