Solving the Traveling Salesman Problem (TSP) with SBM. TSP is often taken up as a concrete example of combinatorial optimization problems.