About this Course
최근 조회 2,901

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

중급 단계

완료하는 데 약 18시간 필요

권장: 4 weeks of study, 6-12 hours/week...

영어

자막: 영어

100% 온라인

지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.

유동적 마감일

일정에 따라 마감일을 재설정합니다.

중급 단계

완료하는 데 약 18시간 필요

권장: 4 weeks of study, 6-12 hours/week...

영어

자막: 영어

강의 계획 - 이 강좌에서 배울 내용

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.

...
8 videos (Total 128 min), 3 readings, 1 quiz
8개의 동영상
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
3개의 읽기 자료
Course Overview10m
Start of Course Survey10m
Workshop 9: CP Basic Search Strategies10m
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.

...
7 videos (Total 143 min), 1 reading, 1 quiz
7개의 동영상
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
1개의 읽기 자료
Workshop 10: CP Advanced Search Strategies10m
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.

...
6 videos (Total 102 min), 1 reading, 1 quiz
6개의 동영상
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
1개의 읽기 자료
Workshop 11: MIP Modelling10m
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.

...
10 videos (Total 160 min), 2 readings, 1 quiz
10개의 동영상
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
2개의 읽기 자료
Workshop 12: Local Search10m
End of Course Survey10m
5.0
2개의 리뷰Chevron Right

Solving Algorithms for Discrete Optimization의 최상위 리뷰

대학: JGMay 12th 2019

very good introduction, lessons are fun to watch and exercises are useful

강사

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

홍콩 중문 대학교 정보

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

자주 묻는 질문

  • 강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.

  • 수료증을 구매하면 성적 평가 과제를 포함한 모든 강좌 자료에 접근할 수 있습니다. 강좌를 완료하면 전자 수료증이 성취도 페이지에 추가되며, 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 콘텐츠만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.