Delivery Problem

开始时间: 08/01/2020 持续时间: Unknown

所在平台: Coursera

课程类别: 计算机科学

大学或机构: CourseraNew



Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.


第一个写评论        关注课程


We’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We still don’t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science. Still, we’ll implement several solutions for real world instances of the travelling salesman problem. While designing these solutions, we will rely heavily on the material learned in the courses of the specialization: proof techniques, combinatorics, probability, graph theory. We’ll see several examples of using discrete mathematics ideas to get more and more efficient solutions. Do you have technical problems? Write to us:

送货问题:我们将每天(以Python方式)共同实施高效的程序,以解决全球各地送货公司每天需要数百万次的问题-旅行商问题。此问题的目标是尽快访问所有给定的地方。如何快速找到该问题的最佳解决方案?对于这个困难的计算问题,我们仍然没有可证明的高效算法,这是P对NP问题的精髓,这是计算机科学中最重要的开放性问题。尽管如此,我们仍将针对旅行商问题的实际案例实施几种解决方案。在设计这些解决方案时,我们将严重依赖于在专业课程中学习的材料:证明技术,组合技术,概率,图论。我们将看到几个使用离散数学思想来获得越来越有效的解决方案的示例。 你有技术上的问题吗?写信给我们





We’ll implement together an efficient program for a problem needed by delivery companies all over th


数学 数学基础 离散数学公开课 离散数学 计算机科学 离散数学课程 旅行商问题