In this online course 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.
本课程是 Introduction to Discrete Mathematics for Computer Science 专项课程 专项课程的一部分
19,162 人已注册
提供方
课程信息
3,297 次近期查看
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始,按照自己的计划学习。
初级
完成时间大约为13 小时
英语(English)
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始,按照自己的计划学习。
初级
完成时间大约为13 小时
英语(English)
授课大纲 - 您将从这门课程中学到什么
完成时间为 5 小时
Traveling Salesman Problem
完成时间为 5 小时
4 个视频 (总计 43 分钟), 1 个阅读材料, 5 个测验
完成时间为 4 小时
Exact Algorithms
完成时间为 4 小时
4 个视频 (总计 49 分钟)
完成时间为 4 小时
Approximation Algorithms
完成时间为 4 小时
2 个视频 (总计 20 分钟)
审阅
- 5 stars76.53%
- 4 stars18.15%
- 3 stars2.79%
- 2 stars2.23%
- 1 star0.27%
来自DELIVERY PROBLEM的热门评论
由 DS 提供Sep 19, 2020
Amazing course with lots of intuitive examples and puzzles
由 NL 提供Mar 21, 2021
This series is great. I am confident to tutor my son in CS now.
Thanks UCSD and HSE
由 LF 提供Jan 13, 2020
This is a very nice course. I feel that a further explanation in the coding problems would be useful since sometimes you are not sure what one should return from the function.
由 AG 提供Jun 27, 2020
Well structured introductory course into transportation problems. The code in examples is well written and clean. It was a pleasure to study this course.
关于 Introduction to Discrete Mathematics for Computer Science 专项课程

常见问题
我什么时候能够访问课程视频和作业?
我购买证书后会得到什么?
有助学金吗?
还有其他问题吗?请访问 学生帮助中心。