------------ TIME STAMP ----------------

TRAVELLING SALESMAN PROBLEM
0:00:00 Delivery Problem
0:12:15 Shortest Common Superstring Problem
0:23:04 Brute Force Search
0:34:58 Nearest Neighbor

EXACT ALGORITHMS
0:43:04 Branch and Bound
0:58:02 Dynamic Programming Main Ideas
1:07:49 Dynamic Programming Representing Subsets
1:18:24 Dynamic Programming Code

APPROXIMATION ALGORITHMS
1:32:13 Approximating Algorithms
1:43:06 Local Search


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

⭐ Important Notes ⭐
⌨️ This course is created in collaboration with University of California

algorithms,
algorithm,
#dynamicprogramming,
traveling salesperson problem,
#travelingsalesmanproblem,
traveling problem,
#assignmentproblem,