欢迎来到离散优化算法篇 (英文原声中文字幕)

Loading...

Из курса от партнера The Chinese University of Hong Kong

离散优化算法篇 Solving Algorithms for Discrete Optimization

оценка

Explore Related Videos

At Coursera, you will find the best lectures in the world. Here are some of our personalized recommendations for you

The Chinese University of Hong Kong

离散优化算法篇 Solving Algorithms for Discrete Optimization

оценка

优化是决策的一般形式，在我们的社会中很常见。它的应用包括从求解数独谜题到婚礼上的座次安排。同样的技术可以调度航班和机组成员，协调钢铁生产，组织铁矿从矿井到港口的运输。人力资源和材料管理上好的决策可以令企业提升上百万的盈利。同样的问题很多也在我们日常生活出现，成为决定每天送货路线，决定学校时间表，传输电力到家里等种种问题的一部分。除了它们的重要性，这些问题如果用传统的本科计算机科学方法难以求解。这门课程为已经完成离散优化高阶篇的同学设计。请看这门课程的宣传视频：http://www.cpr.cuhk.edu.hk/cutv/detail/988

Из урока

基础约束编程

这个模块开始时用例子说明约束编程求解器的基础技术，也就是约束传播和搜索。值域代表了变量可能的取值，而约束可用于在值域上进行推理。约束本身可以以值域传播器和边界传播器的形式表示。你将会学习到一个传播引擎如何处理一组传播器，并通过变量值域协调沟通约束传播得到的信息。你也将会学到基础搜索，变量，数值选择等概念，还有传播和搜索是如何紧密而高效地连接起来的。最后，这个模块介绍了如何在Minizinc中进行编程化搜索。

欢迎来到离散优化算法篇 (英文原声中文字幕)2:37

Познакомьтесь с преподавателями

Prof. Jimmy Ho Man Lee
Professor
Department of Computer Science and Engineering
Prof. Peter James Stuckey
Professor
Computing and Information Systems

Welcome to Solving Algorithms for Discrete Optimization,

which is the third course in our series on discrete optimization.

I am Professor Peter Stuckey.

And I'm Professor Jimmy Lee.

In the previous two courses,

you learned basic and advanced techniques in modeling

practical applications as discrete optimization problems

using the MiniZinc modelling language.

You experienced the joy of solving

such complex and difficult problems without even knowing how MiniZinc solves them.

In this course, we'll uncover the secrets inside these black box solvers,

which we've used in the previous courses.

Oh, I got a call. Excuse me.

Oh, sorry for the interruption.

It was a call from Nuwa.

She was widely thought to be the creator of humankind in Chinese mythology.

She's seeking help from us to deal with a broken and falling sky.

That's all right. We almost forgot to mention that

this course still uses the fable-based approach.

So you will immerse yourselves in interesting stories,

which are again adapted from Chinese classics.

These stories will help to motivate and contextualize

the various algorithms are required in solving discrete optimization problems.

The difference is that we are not following the romance of the Three Kingdoms this time.

Although my favorite character Jugulan still plays important roles in our stories.

What happened was that Jugulan messed around with a magical tablet,

caused huge disruptions to space and time,

and was taken to the beginning of time where he would meet with such characters as Nuwa,

Houyi and the Monkey King, Sun Wukong.

The story spanned across three Chinese classic novels,

Lavos Shan Hai Jing or the Book of Mountains and Seas,

Fengshen Yanyi or the Investiture of Gods.

And last but not the least,

Xiyou Ji or the Journey to the West.

Yes, we all help our heroes to solve difficult problems by barring algorithm's from

constraint programming solvers mixed into

the programming solvers and local search solvers.

What you will learn are the basis,

these state-of-the-art algorithms embedded in modern discrete optimization solvers.

By understanding the inner workings of these underlying solvers,

you'll be able to write better models,

suggest good search where we use the MiniZinc,

and select the right solver for the right task.

Perhaps you can even develop your own solvers.

Under the stories we go.

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.

Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.

© Coursera Inc., 2019 Все права защищены.

Загрузить из App Store

Загрузить в Google Play