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.
oferecido por
Otimização discreta
Universidade de MelbourneInformações sobre o curso
104,257 visualizações recentes
Resultados de carreira do aprendiz
40%
comecei uma nova carreira após concluir estes cursos
40%
consegui um benefício significativo de carreira com este curso
17%
recebi um aumento ou promoção
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível intermediário
Aprox. 65 horas para completar
Inglês
Legendas: Inglês
Habilidades que você terá
Constraint ProgrammingBranch And BoundDiscrete OptimizationLinear Programming (LP)
Resultados de carreira do aprendiz
40%
comecei uma nova carreira após concluir estes cursos
40%
consegui um benefício significativo de carreira com este curso
17%
recebi um aumento ou promoção
Certificados compartilháveis
Tenha o certificado após a conclusão
100% on-line
Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis
Redefinir os prazos de acordo com sua programação.
Nível intermediário
Aprox. 65 horas para completar
Inglês
Legendas: Inglês
oferecido por
Universidade de Melbourne
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.
Programa - O que você aprenderá com este curso
2 horas para concluir
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.
2 horas para concluir
4 vídeos (Total 43 mín.), 3 leituras, 1 teste
4 videos
Course Promo1min
Course Motivation - Indiana Jones, challenges, applications20min
Course Introduction - philosophy, design, grading rubric11min
Assignments Introduction & Any Integer9min
3 leituras
Start of Course Survey10min
Socialize10min
Course Syllabus10min
7 horas para concluir
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.
7 horas para concluir
9 vídeos (Total 101 mín.)
9 videos
Knapsack 2 - greedy algorithms7min
Knapsack 3 - modeling8min
Knapsack 4 - dynamic programming17min
Knapsack 5 - relaxation, branch and bound14min
Knapsack 6 - search strategies, depth first, best first, least discrepancy14min
Assignments Getting Started13min
Knapsack & External Solver10min
Exploring the Material - open course design, optimization landscape, picking your adventure10min
17 horas para concluir
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.
17 horas para concluir
13 vídeos (Total 248 mín.), 1 leitura, 2 testes
13 videos
CP 2 - propagation, arithmetic constraints, send+more=money26min
CP 3 - reification, element constraint, magic series, stable marriage16min
CP 4 - global constraint intuition, table constraint, sudoku19min
CP 5 - symmetry breaking, BIBD, scene allocation18min
CP 6 - redundant constraints, magic series, market split11min
CP 7 - car sequencing, dual modeling18min
CP 8 - global constraints in detail, knapsack, alldifferent33min
CP 9 - search, first-fail, euler knight, ESDD25min
CP 10 - value/variable labeling, domain splitting, symmetry breaking in search28min
Graph Coloring6min
Optimization Tools5min
Set Cover8min
1 leituras
Optimization Tools10min
13 horas para concluir
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.
13 horas para concluir
10 vídeos (Total 191 mín.)
10 videos
LS 2 - swap neighborhood, car sequencing, magic square15min
LS 3 - optimization, warehouse location, traveling salesman, 2-opt, k-opt23min
LS 4 - optimality vs feasibility, graph coloring22min
LS 5 - complex neighborhoods, sports scheduling21min
LS 6 - escaping local minima, connectivity15min
LS 7 - formalization, heuristics, meta-heuristics introduction22min
LS 8 - iterated location search, metropolis heuristic, simulated annealing, tabu search intuition18min
LS 9 - tabu search formalized, aspiration, car sequencing, n-queens26min
Traveling Salesman10min
Avaliações
Principais avaliações do OTIMIZAÇÃO DISCRETA
por SK29 de Mai de 2019
Exceptional coverage of optimization fundamentals. Learning of practical applied methods. Real university level course, no water down "data science". Absolutely love it! Thank you professor Pascal.
por M2 de Jun de 2020
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.
por AM5 de Fev de 2017
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.
por AD5 de Jun de 2019
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.
Perguntas Frequentes – FAQ
Quando terei acesso às palestras e às tarefas?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
- The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
- The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
O que recebo ao adquirir o Certificado?
Quando você adquire o Certificado, ganha acesso a todo o material do curso, incluindo avaliações com nota atribuída. Após concluir o curso, seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.
Qual é a política de reembolso?
Você poderá pedir reembolso total até duas semanas após a data do pagamento, ou (para cursos recém-iniciados) até duas semanas após o início da primeira sessão do curso, o que ocorrer por último. Você não poderá receber reembolso após obter o Certificado de Curso, mesmo que tenha completado o curso dentro do período de duas semanas. Veja nossa política para o reembolso total.
Existe algum auxílio financeiro disponível?
Sim, a Coursera oferece auxílio financeiro aos alunos que não podem pagar a taxa. Faça a solicitação clicando no link Auxílio financeiro, abaixo do botão "Inscreva-se" à esquerda. Você será solicitado a preencher um formulário e será notificado se for aprovado. Saiba mais.
• What are the pre-requisites for the class?
Good programming skills, knowledge of algorithms and linear algebra.
• What programming language will be used in this class?
A minimal knowledge of python is necessary to integrate with the course infrastructure. Outside of that, students are free to use any language of their choice.
• How difficult is this class?
A motivated student spending the time on the programming assignment will succeed in this class.
• Where can I get one of those T-Shirts?
At the discrete optimization store: http://www.zazzle.com.au/discreteoptimization
Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.
