Solving Algorithms for Discrete Optimization

所在平台: CourseraArchive

课程类别: 其他类别

大学或机构: CourseraNew

课程主页: https://www.coursera.org/archive/solving-algorithms-discrete-optimization

课程评论:没有评论

第一个写评论        关注课程

课程简介

The University of Melbourne, The Chinese University of Hong Kong

课程大纲

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.

课程评论(0条)

课程详情

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. This course is intended for students who have completed Advanced Modelling for Discrete Optimization. In this course, you will extend your understanding of how to solve challenging discrete optimization problems by learning more about the solving technologies that are used to solve them, and how a high-level model (written in MiniZinc) is transformed into a form that is executable by these underlying solvers. By better understanding the actual solving technology, you will both improve your modeling capabilities, and be able to choose the most appropriate solving technology to use. Watch the course promotional video here: https://www.youtube.com/watch?v=-EiRsK-Rm08

解决离散优化的算法:当我们有多种选择时,离散优化旨在做出明智的决策。它的应用在整个社会中无处不在。它的应用范围从解决数独难题到在婚礼宴会上安排座位。相同的技术可以安排飞机及其机组人员,协调钢铁生产并组织从矿山到港口的铁矿石运输。关于使用稀缺或昂贵资源(如人员和物力资源)的良好决策也使公司可以提高数百万美元的利润。类似的问题也成为我们日常生活的基础,并且是确定包裹日常运送路线,制定学校时间表以及为家中供电的一部分。尽管它们具有根本的重要性,但这些问题是使用传统的本科计算机科学方法解决的噩梦。 本课程面向已完成离散优化高级建模的学生。在本课程中,您将通过学习有关用于解决难题的离散化技术的更多信息,以及如何将高级模型(用MiniZinc编写)转换为形式来扩展对如何解决具有挑战性的离散优化问题的理解。这些底层求解器可执行。通过更好地了解实际的求解技术,您不仅可以提高建模能力,还可以选择最合适的求解技术来使用。 在此处观看课程宣传视频:https://www.youtube.com/watch?v = -EiRsK-Rm08

课程标签

0人关注该课程

主题相关的课程