Chevron Left
返回到 Delivery Problem

学生对 University of California San Diego 提供的 Delivery Problem 的评价和反馈

4.7
星
375 个评分

课程概述

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. 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....

热门审阅

AT

Nov 19, 2019

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.

LB

Jan 10, 2024

It's a great introductory course to these topics. I didn't particularly enjoy the puzzles and "treasure hunt" in Number Theory and Cryptography but it's just a matter of learning styles I guess.

筛选依据：

51 - Delivery Problem 的 54 个评论（共 54 个）

创建者 Xinwei M

•

Oct 22, 2023

It would be better if I could have the source code for the assignments. Sometimes when I wanted to debug my code on pycharm, I could not do anything because I did not know how to initialize a graph the assignment was using.

创建者 Long C

•

Dec 23, 2021

It would be better if there are materials about networkx and other relevant libraries.

创建者 Gaoge Z

•

Aug 2, 2020

Too difficult compared with previous modules.

创建者 Chen H

•

Jul 2, 2024

not good