Branch & Bound Algorithm: LP Based Approach

This lecture covers the Branch & Bound algorithm, focusing on the LP-based approach. It explains the steps involved, such as branching, pruning, and bounding, to find the optimal solution efficiently. The instructor discusses examples and applications, including the Pigeonhole Problem and Directed TSP Lower Bound.