Lecture
Branch and Bound: Heuristic Maximization
Description
This lecture covers the Branch and Bound algorithm applied to the heuristic maximization problem, focusing on the use of LP relaxations and pruning techniques to find optimal solutions. The instructor explains how information flows down the tree, the conditions for infeasibility, and the importance of parent-child relationships in the algorithm.
Official 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.