Lecture 04-14-17

Branch and bound

• Some AI people prefer A*, this is special case
• Any bounding function
• Approximation algorithms give you a really non-obvious bound
• Cut off the tree
• Goal: to make the algorithm stop as quickly as possible
• Lower bound: size of solution