Lecture
Discrete Optimization: The Curse of Dimensionality
Description
This lecture explores the challenges of discrete optimization, focusing on the curse of dimensionality. The instructor explains how the computational time exponentially increases with problem size, making complete enumeration infeasible. Even with advancements in computing power, the curse of dimensionality remains a significant obstacle, requiring the development of more efficient algorithms.
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.