Algorithms for NP-Hard Problems in MIP 🧩
Explore algorithms for solving NP-hard problems via mixed integer programming, a key approach for complex discrete optimization challenges.
Tim Roughgarden Lectures
1.8K views • May 13, 2020
About this video
Most discrete optimization problems, including all those studied in this video playlist, can be cast as mixed integer programming (MIP)
problems. Whenever you're faced with a problem that you can encode efficiently as a MIP problem, throwing a MIP solver at it is probably worth a shot.
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Video Information
Views
1.8K
Likes
26
Duration
17:00
Published
May 13, 2020
User Reviews
4.5
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now