Algorithms for NP-Hard Problems (Section 21.4: Mixed Integer Programming Solvers)
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: • Algorithms Illuminated, Part 4: Algorithms...
On this page of the site you can watch the video online Algorithms for NP-Hard Problems (Section 21.4: Mixed Integer Programming Solvers) with a duration of hours minute second in good quality, which was uploaded by the user Tim Roughgarden Lectures 12 May 2020, share the link with friends and acquaintances, this video has already been watched 1,791 times on youtube and it was liked by 26 viewers. Enjoy your viewing!
