課程信息
5.0
4 個評分
1 個審閱
100% online

100% online

立即開始,按照自己的計劃學習。
可靈活調整截止日期

可靈活調整截止日期

根據您的日程表重置截止日期。
中級

中級

完成時間(小時)

完成時間大約為15 小時

建議:4 weeks of study, 6-12 hours/week...
可選語言

英語(English)

字幕:英語(English)...
100% online

100% online

立即開始,按照自己的計劃學習。
可靈活調整截止日期

可靈活調整截止日期

根據您的日程表重置截止日期。
中級

中級

完成時間(小時)

完成時間大約為15 小時

建議:4 weeks of study, 6-12 hours/week...
可選語言

英語(English)

字幕:英語(English)...

教學大綱 - 您將從這門課程中學到什麼

1
完成時間(小時)
完成時間為 6 小時

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 個視頻(共 128 分鐘), 3 個閱讀材料, 1 個測驗
Video8 個視頻
3.1.1 Constraint Programming Solvers13分鐘
3.1.2 Domains + Propagators18分鐘
3.1.3 Bounds Propagation21分鐘
3.1.4 Propagation Engine21分鐘
3.1.5 Search25分鐘
3.1.6 Module 1 Summary4分鐘
Workshop 919分鐘
Reading3 個閱讀材料
Course Overview10分鐘
Start of Course Survey10分鐘
Workshop 9: CP Basic Search Strategies10分鐘
2
完成時間(小時)
完成時間為 6 小時

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 個視頻(共 143 分鐘), 1 個閱讀材料, 1 個測驗
Video7 個視頻
3.2.2 Restart and Advanced Search20分鐘
3.2.3 Inside Alldifferent14分鐘
3.2.4 Inside Cumulative14分鐘
3.2.5 Flattening39分鐘
3.2.6 Module 2 Summary6分鐘
Workshop 1030分鐘
Reading1 個閱讀材料
Workshop 10: CP Advanced Search Strategies10分鐘
3
完成時間(小時)
完成時間為 5 小時

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 個視頻(共 102 分鐘), 1 個閱讀材料, 1 個測驗
Video6 個視頻
3.3.2 Mixed Integer Programming17分鐘
3.3.3 Cutting Planes14分鐘
3.3.4 MiniZinc to MIP13分鐘
3.3.5 Module 3 Summary4分鐘
Workshop 1126分鐘
Reading1 個閱讀材料
Workshop 11: MIP Modelling10分鐘
4
完成時間(小時)
完成時間為 6 小時

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 個視頻(共 160 分鐘), 2 個閱讀材料, 1 個測驗
Video10 個視頻
3.4.2 Constraints and Local Search12分鐘
3.4.3 Escaping Local Minima- Restart6分鐘
3.4.4 Simulated Annealing7分鐘
3.4.5 Tabu List9分鐘
3.4.6 Discrete Langrange Multiplier Methods28分鐘
3.4.7 Large Neighbourhood Search24分鐘
3.4.8 MiniZinc to Local Search16分鐘
3.4.9 Module 4 Summary8分鐘
Workshop 1230分鐘
Reading2 個閱讀材料
Workshop 12: Local Search10分鐘
End of Course Survey10分鐘

講師

Avatar

Prof. Jimmy Ho Man Lee

Professor
Department of Computer Science and Engineering
Avatar

Prof. Peter James Stuckey

Professor
Computing and Information Systems

關於 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....

關於 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....

常見問題

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您购买证书后,将有权访问所有课程材料,包括评分作业。完成课程后,您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

還有其他問題嗎?請訪問 學生幫助中心