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.
Offered By
Discrete Optimization
The University of MelbourneAbout this Course
Could your company benefit from training employees on in-demand skills?
Try Coursera for BusinessSkills you will gain
- Constraint Programming
- Branch And Bound
- Discrete Optimization
- Linear Programming (LP)
Could your company benefit from training employees on in-demand skills?
Try Coursera for BusinessOffered by
Syllabus - What you will learn from this course
Welcome
Knapsack
Constraint Programming
Local Search
Reviews
- 5 stars89.04%
- 4 stars8.25%
- 3 stars0.99%
- 2 stars0.14%
- 1 star1.56%
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!!!!
Very good course for operation research aspirants. Assignments are very good to understand the problems and the complexity of the problems.Thanks to the team
I just completed the course. This an amazing course with an Outstanding professor and highly interesting, although difficult, assignments. Thanks for this! I am proud to have finished
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.
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.