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.
Optimization technology is ubiquitous in our society. It schedules planes and their crews, coordinates the production of steel, and organizes the transportation of iron ore from the mines to the ports. Optimization clears the day-ahead and real-time markets to deliver electricity to millions of people. It organizes kidney exchanges and cancer treatments and helps scientists understand the fundamental fabric of life, control complex chemical reactions, and design drugs that may benefit billions of individuals.
This class is an introduction to discrete optimization and exposes students to some of the most fundamental concepts and algorithms in the field. It covers constraint programming, local search, and mixed-integer programming from their foundations to their applications for complex practical problems in areas such as scheduling, vehicle routing, supply-chain optimization, and resource allocation.
Discrete Optimization
ofrecido por
The University of Melbourne
Acerca de este Curso
4.9
232 calificaciones
Habilidades que obtendrás
Constraint ProgrammingBranch And BoundDiscrete OptimizationLinear Programming (LP)
Programa - Qué aprenderás en este curso
Semana
1Welcome
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.
4 videos (Total 43 minutos), 3 readings, 1 quiz
4 videos
Course Motivation - Indiana Jones, challenges, applications20m
Course Introduction - philosophy, design, grading rubric11m
Assignments Introduction & Any Integer9m
3 lecturas
Start of Course Survey10m
Socialize10m
Course Syllabus10m
Semana
2Knapsack
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.
9 videos (Total 101 minutos), 1 quiz
9 videos
Knapsack 2 - greedy algorithms7m
Knapsack 3 - modeling8m
Knapsack 4 - dynamic programming17m
Knapsack 5 - relaxation, branch and bound14m
Knapsack 6 - search strategies, depth first, best first, least discrepancy14m
Assignments Getting Started13m
Knapsack & External Solver10m
Exploring the Material - open course design, optimization landscape, picking your adventure10m
Semana
3Constraint 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.
13 videos (Total 248 minutos), 1 reading, 2 quizzes
13 videos
CP 2 - propagation, arithmetic constraints, send+more=money26m
CP 3 - reification, element constraint, magic series, stable marriage16m
CP 4 - global constraint intuition, table constraint, sudoku19m
CP 5 - symmetry breaking, BIBD, scene allocation18m
CP 6 - redundant constraints, magic series, market split11m
CP 7 - car sequencing, dual modeling18m
CP 8 - global constraints in detail, knapsack, alldifferent33m
CP 9 - search, first-fail, euler knight, ESDD25m
CP 10 - value/variable labeling, domain splitting, symmetry breaking in search28m
Graph Coloring6m
Optimization Tools5m
Set Cover8m
1 lectura
Optimization Tools10m
Semana
4Local 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.
10 videos (Total 191 minutos), 1 quiz
10 videos
LS 2 - swap neighborhood, car sequencing, magic square15m
LS 3 - optimization, warehouse location, traveling salesman, 2-opt, k-opt23m
LS 4 - optimality vs feasibility, graph coloring22m
LS 5 - complex neighborhoods, sports scheduling21m
LS 6 - escaping local minima, connectivity15m
LS 7 - formalization, heuristics, meta-heuristics introduction22m
LS 8 - iterated location search, metropolis heuristic, simulated annealing, tabu search intuition18m
LS 9 - tabu search formalized, aspiration, car sequencing, n-queens26m
Traveling Salesman10m
33%
comenzó una nueva carrera después de completar estos cursos
40%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
Principales revisiones
por AM•Feb 6th 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 KD•Sep 4th 2018
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
Instructores
Dr. Carleton Coffrin
Adjunct LecturerComputing and Information Systems
Acerca de The University of 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.
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.
¿Qué recibiré si compro el Certificado?
Cuando compras un Certificado, obtienes acceso a todos los materiales del curso, incluidas las tareas calificadas. Una vez que completes el curso, se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes participar del curso como oyente sin costo.
¿Cuál es la política de reembolsos?
¿Hay ayuda económica disponible?
• 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
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
Coursera brinda acceso universal a la mejor educación del mundo, al asociarse con las mejores universidades y organizaciones, para ofrecer cursos en línea.
© 2018 Coursera Inc. Todos los derechos reservados.
