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
- 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.
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.
Excellent course! The course video are very clear and build on each other as the course progress. It is well structured. The assignments have the right amount of difficulty.
Is financial aid available?
• What are the pre-requisites for the class?
Good programming skills, knowledge of algorithms and linear algebra.
• What programming language will be used in this class?
A minimal knowledge of python is necessary to integrate with the course infrastructure. Outside of that, students are free to use any language of their choice.
• How difficult is this class?
A motivated student spending the time on the programming assignment will succeed in this class.
• Where can I get one of those T-Shirts?
At the discrete optimization store: http://www.zazzle.com.au/discreteoptimization