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
Discrete Optimization: Relaxation
Description
This lecture explains how to solve discrete optimization problems by relaxing integrality constraints, turning them into linear optimization problems. The relaxation provides a lower bound on the optimal solution, but rounding the relaxed solution may not work for finding feasible solutions.
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.