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 stars89.01%
- 4 stars8.16%
- 3 stars1.12%
- 2 stars0.14%
- 1 star1.54%
TOP REVIEWS FROM DISCRETE OPTIMIZATION
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.
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.
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!!!!
This is an amazing course to really help students explore the variety of techniques that are available to solve extremely hard optimization problems.
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.