Solving Algorithms for Discrete Optimization

2.4 rating

Discrete Optimization aims to make good decisions when we have many possibilities to choose from. Its applications are ubiquitous throughout our society. Its applications range from solving Sudoku puzzles to arranging seating in a wedding banquet.

The same technology can schedule planes and their crews coordinate the production of steel and organize the transportation of iron ore from the mines to the ports. Good decisions on the use of scarce or expensive resources such as staffing and material resources also allow corporations to improve their profit by millions of dollars.

Similar problems also underpin much of our daily lives and are part of determining daily delivery routes for packages making school timetables and delivering power to our homes. Despite their fundamental importance these problems are a nightmare to solve using traditional undergraduate computer science methods.

6 hours to complete
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

6 hours to complete
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

5 hours to complete
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 hours to complete
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

Tham gia đánh giá khóa học

Nếu bạn đã học qua khóa học này thì mời bạn tham gia đóng góp ý kiến và đánh giá để cộng đồng bạn học có thêm thông tin tham khảo.

Cung cấp bởi: Coursera /  The University of Melbourne

Thời lượng: 22 giờ
Ngôn ngữ giảng dạy: Tiếng Anh
Chi phí: Miễn phí / 0
Đối tượng: Intermediate

Thông tin về nhà cung cấp

Coursera (/ kərˈsɛrə /) là một nền tảng học tập trực tuyến toàn cầu được thành lập vào năm 2012 bởi 2 giáo sư khoa học máy tính của đại học Stanford là Andrew NgDaphne Koller, nền tảng này cung cấp các khóa học trực tuyến (MOOC) cho cộng đồng người học online.

Coursera hợp tác với các trường đại học danh tiếng tại Bắc Mỹ và trên khắp thế giới, cùng với nhiều tổ chức khác để cung cấp các khóa học trực tuyến chất lượng, theo chuyên ngành và được cấp chứng chỉ trong nhiều lĩnh vực như kỹ thuật, khoa học dữ liệu, học máy, toán học, kinh doanh, khoa học máy tính, tiếp thị kỹ thuật số, nhân văn, y học, sinh học, khoa học xã hội , và nhiều ngành khác.

Các khóa học cùng chủ đề

Visual Perception for Self-Driving Cars

This course will introduce you to the main perception tasks in autonomous driving, static and dynamic object detection, and will survey common computer vision methods for robotic perception. By the...

Motion Planning for Self-Driving Cars

This course will introduce you to the main planning tasks in autonomous driving, including mission planning, behavior planning and local planning. By the end of this course, you will be...

Capstone: Autonomous Runway Detection for IoT

This capstone project course ties together the knowledge from three previous courses in IoT though embedded systems: Development of Real-Time Systems Web Connectivity & Security and Embedded Hardware and Operating...

Leave a Reply

Your email address will not be published. Required fields are marked *

Scroll to Top