автор: Alex D•
Oct 11, 2018
The course is a good sequel in the “… Discrete Optimization” series. With just about any programming language, the true understanding of how the program is run by the computer helps tuning the program, minimizing the execution time. The same is especially true in optimization, as instead of the “classical” imperative programs we have “models” that are digested by some “solver”, which actually does all the number crunching. Different solvers (and the same solver with different configuration) can behave drastically different while running the same model. So this course finally removes the veil and uncovers the things inside these solvers, that were considered as black boxes in the previous two courses. The course is likely to motivate you to experiment with different solvers for the same models, and, maybe, even implementing your own solver.
автор: lucas d•
Feb 08, 2020
A course to learn in depth the inner workings of CP solvers and how to get the best of them. With an introduction to other advanced techniques to find the best approach to discrete problems (MIP, Local Search). The Romance of the Three Kingdoms-inspired animations and puzzles are engaging and makes for an exciting learning experience.
автор: Boris O•
Dec 11, 2019
The course was extremely useful. I'm still a long way from mastering the material, but it helped me immensely in understanding some of the aspects of discrete optimization. I now feel inspired to learn more in the field. Many thanks to the creators of the course!
автор: Jan G•
May 12, 2019
very good introduction, lessons are fun to watch and exercises are useful
Jun 20, 2019
Great innovation for new way of thinking