*开始时间: 11/14/2018
持续时间: Unknown*

所在平台: Coursera 课程类别: 计算机科学 大学或机构: CourseraNew |

课程主页: https://www.coursera.org/learn/delivery-problem

Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.课程评论：没有评论

We’ll implement together an efficient program 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 efficient 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.