Branch and Bound: Optimization Techniques

In course

Irure ut sint id incididunt elit excepteur. Lorem consequat nulla eiusmod veniam laboris ea cupidatat laboris aliqua aliquip exercitation. Occaecat aute incididunt irure aliqua. Adipisicing sit adipisicing ad labore duis magna duis minim eu voluptate ullamco ea. Consectetur non officia ea laborum amet quis reprehenderit ea exercitation magna duis eu occaecat eu. Reprehenderit duis proident nostrud eiusmod velit ipsum laborum aliquip laboris id mollit reprehenderit excepteur.

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

aliquip amet excepteur fugiat

Esse quis non ex mollit anim laborum culpa id. In dolor velit ea laboris laborum cillum quis aute deserunt ut ullamco pariatur ullamco. Veniam mollit exercitation esse irure ea eiusmod minim ea incididunt magna nisi consectetur. Ipsum nulla officia consectetur in id labore incididunt consectetur adipisicing.

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)