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
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
it needs creativity:) assignments are specially hard! doing this course will increase your problem solving skill!
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.
Too good course! One of the very best courses on Coursera!
Thank you so much. It is a wonder to follow your course.
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.