Tired of solving Sudokus by hand? This class teaches you how to solve complex search problems with discrete optimization concepts and algorithms, including constraint programming, local search, and mixed-integer programming.
Об этом курсе
The University of Melbourne is an internationally recognised research intensive University with a strong tradition of excellence in teaching, research, and community engagement. Established in 1853, it is Australia's second oldest University.
- 5 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
Лучшие отзывы о курсе ДИСКРЕТНАЯ ОПТИМИЗАЦИЯ
Exceptional coverage of optimization fundamentals. Learning of practical applied methods. Real university level course, no water down "data science". Absolutely love it! Thank you professor Pascal.
Great course, the teacher is very clear and often goes into sufficient depth for the student to understand concepts. Assignments are challenging and help understanding course content.
This is, without a doubt, one of the most interesting courses I have ever taken. You will be challenged to create your own ideas and you will get to know what NP hard means in practice.
I like the instructor teaching approach and the evaluation system, the subject itself took me a lot of effort and i think the LNS technique should be teached just after local search.
Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оплатив сертификацию?
Можно ли получить финансовую помощь?
• What are the pre-requisites for the class?
• What programming language will be used in this class?
• How difficult is this class?
• Where can I get one of those T-Shirts?
Остались вопросы? Посетите Центр поддержки учащихся.