The branch-and-bound method is used to solve optimization problems by systematically evaluating potential solutions through traversing a state space tree. It improves on backtracking by not limiting the traversal order and using bounds to prune unpromising nodes. For the traveling salesperson problem, an initial tour provides an upper bound, local information at each node gives a lower bound, and nodes are expanded in best-first order until an optimal tour is found or proven impossible.