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 專項課程 專項課程的一部分
18,092 人已註冊
提供方
加州大学圣地亚哥分校
俄罗斯国家研究型高等经济大学
課程信息
5,785 次近期查看
可靈活調整截止日期
根據您的日程表重置截止日期。
可分享的證書
完成後獲得證書
100% 在線
立即開始，按照自己的計劃學習。
初級
完成時間大約為14 小時
英語（English）
字幕：阿拉伯語（Arabic）, 法語（French）, （歐洲人講的）葡萄牙語, 意大利語, 越南語, 德語（German）, 俄語（Russian）, 英語（English）, 西班牙語（Spanish）
可靈活調整截止日期
根據您的日程表重置截止日期。
可分享的證書
完成後獲得證書
100% 在線
立即開始，按照自己的計劃學習。
初級
完成時間大約為14 小時
英語（English）
字幕：阿拉伯語（Arabic）, 法語（French）, （歐洲人講的）葡萄牙語, 意大利語, 越南語, 德語（German）, 俄語（Russian）, 英語（English）, 西班牙語（Spanish）
提供方
加州大学圣地亚哥分校
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
俄罗斯国家研究型高等经济大学
HSE University is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more.
授課大綱 - 您將從這門課程中學到什麼
完成時間為 5 小時
Traveling Salesman Problem
We start this module with the definition of mathematical model of the delivery problem — the classical traveling salesman problem (usually abbreviated as TSP). We'll then review just a few of its many applications: from straightforward ones (delivering goods, planning a trip) to less obvious ones (data storage and compression, genome assembly). After that, we will together take the first steps in implementing programs for TSP.
完成時間為 5 小時
4 個視頻 （總計 43 分鐘）, 1 個閱讀材料, 5 個測驗
完成時間為 4 小時
Exact Algorithms
We'll see two general techniques applied to the traveling salesman problem. The first one, branch and bound, is a classical approach in combinatorial optimization that is used for various problems. It can be seen as an improvement of the brute force search: we try to construct a permutation piece by piece, but at each step we check whether it still makes sense to continue constructing the permutation (if it doesn't, we just cut off the current branch). The second one, dynamic programming, is arguably the most popular algorithmic technique. It solves a problem by going through a collection of smaller subproblems.
完成時間為 4 小時
4 個視頻 （總計 49 分鐘）
完成時間為 5 小時
Approximation Algorithms
As we've seen in the previous modules, solving the traveling salesman problem exactly is hard. In fact, we don't even expect an efficient solution in the nearest future. For this reason, it makes sense to ask: is it possible to find efficiently a solution that is probably suboptimal, but at the same time is close to optimal? It turns out that the answer is yes! We'll learn two algorithms. The first one guarantees to find quickly a solution which is at most twice longer than the optimal one. The second algorithms does not have such guarantees, but it is known to work pretty well in practice.
完成時間為 5 小時
2 個視頻 （總計 20 分鐘）
審閱
來自DELIVERY PROBLEM的熱門評論
由 AS 提供2018年7月24日
This final course in 5 course specialization is relatively easy one, although the last problem takes little bit time to solve. Provides good introduction to difficult to learn Delivery problem.
由 LF 提供2020年1月13日
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.
由 AT 提供2019年11月19日
A fun conclusion to the specialization that brings all of the mathematics of combinatorics and graph theory together to show how it can be applied to some real world problems.
由 TA 提供2021年3月29日
O curso é muito interessante, porém a explicação é um pouco confusa. Poderia ter uma explicação em vídeo da parte envolvendo programação, e não apenas deixar isso como tarefa
關於 Introduction to Discrete Mathematics for Computer Science 專項課程
Discrete Mathematics is the language of Computer Science. One needs to be fluent in it to work in many fields including data science, machine learning, and software engineering (it is not a coincidence that math puzzles are often used for interviews). We introduce you to this language through a fun try-this-before-we-explain-everything approach: first you solve many interactive puzzles that are carefully designed specifically for this online specialization, and then we explain how to solve the puzzles, and introduce important ideas along the way. We believe that this way, you will get a deeper understanding and will better appreciate the beauty of the underlying ideas (not to mention the self confidence that you gain if you invent these ideas on your own!). To bring your experience closer to IT-applications, we incorporate programming examples, problems, and projects in the specialization.
常見問題
我什么时候能够访问课程视频和作业？
我订阅此专项课程后会得到什么？
有助学金吗？
還有其他問題嗎？請訪問 學生幫助中心。
