Delivery Problem

Add to Favourites
1 1 1 1 1
Price: 986 EUR 986 EUR
Contact University of California, San Diego

More details about the program

Description

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: This email address is being protected from spambots. You need JavaScript enabled to view it.

Specific details

Category of Education Physical Science

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

Do you want to talk about climate change from an i ...
In this physics course, you will learn about the q ...
The movement of bodies in space (like spacecraft, ...
This course challenges you to consider how one mig ...

 

©2021 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know info@educom.net