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.
Solving Algorithms for Discrete Optimization
Solving Algorithms for Discrete Optimization
顶尖授课教师
访问权限由 New York State Department of Labor 提供
11,308 人已注册
了解顶级公司的员工如何掌握热门技能
该课程共有4个模块
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个视频3篇阅读材料1个编程作业
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个视频1篇阅读材料1个编程作业
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个视频1篇阅读材料1个编程作业
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个视频1篇阅读材料1个编程作业
人们为什么选择 Coursera 来帮助自己实现职业发展
Felipe M.
Jennifer J.
Larry W.
Chaitanya A.
学生评论
- 5 stars
88.63%
- 4 stars
6.81%
- 3 stars
0%
- 2 stars
0%
- 1 star
4.54%
显示 3/44 个
已于 May 11, 2019审阅
very good introduction, lessons are fun to watch and exercises are useful
从 Computer Science 浏览更多内容
The Chinese University of Hong Kong
The Chinese University of Hong Kong
Birla Institute of Technology & Science, Pilani
