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.
от партнера
Дискретная оптимизация
Мельбурнский университетОб этом курсе
Приобретаемые навыки
- Constraint Programming
- Branch And Bound
- Discrete Optimization
- Linear Programming (LP)
от партнера

Мельбурнский университет
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.
Программа курса: что вы изучите
Welcome
These lectures and readings give you an introduction to this course: its philosophy, organization, and load. They also tell you how the assignments are a significant part of the class. This week covers the common input/output organization of the assignments, how they are graded, and how to succeed in this class.
Knapsack
These lectures introduce optimization problems and some optimization techniques through the knapsack problem, one of the most well-known problem in the field. It discusses how to formalize and model optimization problems using knapsack as an example. It then reviews how to apply dynamic programming and branch and bound to the knapsack problem, providing intuition behind these two fundamental optimization techniques. The concept of relaxation and search are also discussed.
Constraint Programming
Constraint programming is an optimization technique that emerged from the field of artificial intelligence. It is characterized by two key ideas: To express the optimization problem at a high level to reveal its structure and to use constraints to reduce the search space by removing, from the variable domains, values that cannot appear in solutions. These lectures cover constraint programming in detail, describing the language of constraint programming, its underlying computational paradigm and how it can be applied in practice.
Local Search
Local search is probably the oldest and most intuitive optimization technique. It consists in starting from a solution and improving it by performing (typically) local perturbations (often called moves). Local search has evolved substantially in the last decades with a lot of attention being devoted on which moves to explore. These lectures explore the theory and practice of local search, from the concept of neighborhood and connectivity to meta-heuristics such as tabu search and simulated annealing.
Рецензии
- 5 stars89,05 %
- 4 stars8,13 %
- 3 stars1,03 %
- 2 stars0,14 %
- 1 star1,62 %
Лучшие отзывы о курсе ДИСКРЕТНАЯ ОПТИМИЗАЦИЯ
Perfect delivery. Very smooth and nice. An adequate level of difficulty in assigments. The best online course I have passsed.
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
Amazing course! Prof. Pascal is awesome, challenging, and motivating, teaches all the fundamentals of discrete optimization very clearly.
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
Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оплатив сертификацию?
Можно ли получить финансовую помощь?
• 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?
Остались вопросы? Посетите Центр поддержки учащихся.