Up: Solving the Traveling Sales
Previous: 1.2 Distance matrix
Next: 2.1 Starting Branch &
2 Branch & Bound
Branch & Bound is an algorithm that finds an optimal solution. But the price to pay is high - even if the algorithm doesn't check all valid solutions, the complexity is exponential. This means you shouldn't try TSPs with more than 8-10 knots, unless you have plenty of time.
Subsections