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）
メルボルン大学（The University of Melbourne）
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 stars89.31%
- 4 stars7.93%
- 3 stars1.06%
- 2 stars0.15%
- 1 star1.52%
This was more than introduction for me. Loved every second for me, got grades, but will try to improve obviously.
Too good course! One of the very best courses on Coursera! Thank you so much. It is a wonder to follow your course.
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 wish there was 6 start rating so i can give this prof his due, he made a very complicated subject look very simple and easy to understand thanks a million
• 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?