Branch and bound

1. Branch and bound branch and bound methods economize the search for the best trees by backing out of dead alleys.

2. The Traveling Salesman Problem the technique can be used to solve the traveling salesman problem.

3. The Traveling Salesman Problem an arbitrary route. d=5.4342

4. The Traveling Salesman Problem greedy, starting from each point d=5.4342 d=2.8027

5. The Traveling Salesman Problem solution found by branch and bound d=5.4342 d=2.8027 d=2.7812

6. The Traveling Salesman Problem the problem as a decision tree with 3 628 800 (10!) paths 1,2,3,4,5,6,7,9,8,10 1,2,3,4,5,6,7,9,10,8 1,2,3,4,5,6,7,10,8,9 1,2,3,4,5,6,7,10,9,8 1,2,3,4,5,6,7,8,9,10 1,2,3,4,5,6,7,8,10,9 8 8 9 10 9 10 10 9 10 8 8 9 8 9 10 5 6 4 3 4 3 5 2 4 3 5 2 6 1 … start

7. Branching and bounding B&B walk along the paths, and keep track of the distance travelled and the shortest route as yet

8. Branching and bounding and bound back out of lengthypaths distance=x distance>x

9. Branch and bound for parsimony e b a d a b a c b c b a a d d c b e c d e c e e d b b c a a c a e b e d d c a a b b c c d d e e d e a a b b e a a c b c c d d b d d c d a a c d b b e e c c d a a e d b c b e a c b

10. Branch and bound for parsimony 11 11 9 11 11 11 10 9 8 9 10 8 7 9 11 9 9 11 5

11. Branch and bound for parsimony 11 11 9 11 11 11 10 9 8 9 10 8 7 9 11 9 9 11 5

12. Branch and bound for parsimony 11 11 9 11 11 11 10 9 8 9 10 8 7 9 11 9 9 11 5