**关于此课程： **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.

Really liked the course; the python code in challenges is so well commented that it helped me learn a lot of math and code. Really appreciate the challenges and visual explanation he does by drawing graphs; specially in branch and bound. Could have made video instruction a little more friendly to people with low intuitive mathematical knowledge. Left a lot of gaps to be filled by self learning efforts through Google etc; as each video had a line or two that weren't explained up to the mark. I do take a lot of online courses on Udemy and I do love learning by myself and facing challenges; however I also really like when course instructors provide me clear and rock solid fundamental knowledge.