Acerca de este Curso
5.0
4 calificaciones
1 revisiones
100 % en línea

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.
Nivel intermedio

Nivel intermedio

Horas para completar

Aprox. 15 horas para completar

Sugerido: 4 weeks of study, 6-12 hours/week...
Idiomas disponibles

Inglés (English)

Subtítulos: Inglés (English)...
100 % en línea

100 % en línea

Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles

Fechas límite flexibles

Restablece las fechas límite en función de tus horarios.
Nivel intermedio

Nivel intermedio

Horas para completar

Aprox. 15 horas para completar

Sugerido: 4 weeks of study, 6-12 hours/week...
Idiomas disponibles

Inglés (English)

Subtítulos: Inglés (English)...

Programa - Qué aprenderás en este curso

Semana
1
Horas para completar
6 horas para completar

Basic Constraint Programming

This module starts by using an example to illustrate the basic machinery of Constraint Programming solvers, namely constraint propagation and search. While domains represent possibilities for variables, constraints are actively used to reason about domains and can be encoded as domain propagators and bounds propagators. You will learn how a propagation engine handles a set of propagators and coordinates the propagation of constraint information via variable domains. You will also learn basic search, variable and value choices, and how propagation and search can be combined in a seamless and efficient manner. Last but not least, this module describes how to program search in MiniZinc....
Reading
8 videos (Total: 128 min), 3 readings, 1 quiz
Video8 videos
3.1.1 Constraint Programming Solvers13m
3.1.2 Domains + Propagators18m
3.1.3 Bounds Propagation21m
3.1.4 Propagation Engine21m
3.1.5 Search25m
3.1.6 Module 1 Summary4m
Workshop 919m
Reading3 lecturas
Course Overview10m
Start of Course Survey10m
Workshop 9: CP Basic Search Strategies10m
Semana
2
Horas para completar
6 horas para completar

Advanced Constraint Programming

In this module, you will see how Branch and Bound search can solve optimization problems and how search strategies become even more important in such situations. You will be exposed to advanced search strategies, including restart search and impact-based search. The module also uncovers the inner workings of such global constraints as alldifferent and cumulative....
Reading
7 videos (Total: 143 min), 1 reading, 1 quiz
Video7 videos
3.2.2 Restart and Advanced Search20m
3.2.3 Inside Alldifferent14m
3.2.4 Inside Cumulative14m
3.2.5 Flattening39m
3.2.6 Module 2 Summary6m
Workshop 1030m
Reading1 lectura
Workshop 10: CP Advanced Search Strategies10m
Semana
3
Horas para completar
5 horas para completar

Mixed Integer Programming

This module starts by introducing linear programming and the Simplex algorithm for solving continuous linear optimization problems, before showing how the method can be incorporated into Branch and Bound search for solving Mixed Integer Programs. Learn Gomory Cuts and the Branch and Cut method to see how they can speed up solving....
Reading
6 videos (Total: 102 min), 1 reading, 1 quiz
Video6 videos
3.3.2 Mixed Integer Programming17m
3.3.3 Cutting Planes14m
3.3.4 MiniZinc to MIP13m
3.3.5 Module 3 Summary4m
Workshop 1126m
Reading1 lectura
Workshop 11: MIP Modelling10m
Semana
4
Horas para completar
6 horas para completar

Local Search

This module takes you into the exciting realm of local search methods, which allow for efficient exploration of some otherwise large and complex search space. You will learn the notion of states, moves and neighbourhoods, and how they are utilized in basic greedy search and steepest descent search in constrained search space. Learn various methods of escaping from and avoiding local minima, including restarts, simulated annealing, tabu lists and discrete Lagrange Multipliers. Last but not least, you will see how Large Neighbourhood Search treats finding the best neighbour in a large neighbourhood as a discrete optimization problem, which allows us to explore farther and search more efficiently....
Reading
10 videos (Total: 160 min), 2 readings, 1 quiz
Video10 videos
3.4.2 Constraints and Local Search12m
3.4.3 Escaping Local Minima- Restart6m
3.4.4 Simulated Annealing7m
3.4.5 Tabu List9m
3.4.6 Discrete Langrange Multiplier Methods28m
3.4.7 Large Neighbourhood Search24m
3.4.8 MiniZinc to Local Search16m
3.4.9 Module 4 Summary8m
Workshop 1230m
Reading2 lecturas
Workshop 12: Local Search10m
End of Course Survey10m

Instructores

Avatar

Prof. Jimmy Ho Man Lee

Professor
Department of Computer Science and Engineering
Avatar

Prof. Peter James Stuckey

Professor
Computing 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....

Acerca de The Chinese University of Hong Kong

Founded in 1963, The Chinese University of Hong Kong (CUHK) is a forward looking comprehensive research university with a global vision and a mission to combine tradition with modernity, and to bring together China and the West. CUHK teachers and students hail from all corners of the world. CUHK graduates are connected worldwide through an expansive alumni network....

Preguntas Frecuentes

  • 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.

  • 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.

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.