Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Branch & Bound Algorithm: LP Based Approach
Description
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.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.