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.
Discrete OptimizationThe University of Melbourne
About this Course
Skills you will gain
- Constraint Programming
- Branch And Bound
- Discrete Optimization
- Linear Programming (LP)
Syllabus - What you will learn from this course
- 5 stars88.99%
- 4 stars8.18%
- 3 stars1.12%
- 2 stars0.14%
- 1 star1.55%
TOP REVIEWS FROM DISCRETE OPTIMIZATION
Well-defined course and interesting lecturer. He's highly engaging although the material of the course is pretty technical. Thanks a lot for making this course!!!!
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.
it needs creativity:) assignments are specially hard! doing this course will increase your problem solving skill!
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
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I purchase the Certificate?
Is financial aid available?
• 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?
More questions? Visit the Learner Help Center.