Branch and Bound: Optimization Techniques

In course

Reprehenderit eiusmod ipsum quis ex nisi minim esse ad proident nisi pariatur. Aute sunt elit eu aliqua amet ut amet. Ea ut occaecat nulla nisi minim eiusmod cupidatat officia sunt.

Description

This lecture introduces the Branch and Bound optimization technique, illustrating its application through examples. The instructor explains how to find feasible solutions and improve them iteratively by splitting problem spaces. The lecture covers LP Relaxation, Integral Optimal Solutions, and the process of deleting subproblems to reach the optimal solution.

Instructor

aliqua nulla

Fugiat qui ex sunt voluptate exercitation dolor mollit occaecat mollit ut commodo est. Reprehenderit officia sint incididunt quis laborum consequat. Ullamco ullamco cupidatat quis ea non minim proident occaecat irure mollit ipsum.

Official source

https://mediaspace.epfl.ch/media/0_2tuxo5p4

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (35)