Traveling Salesman Problem

Loading...
View Syllabus

Skills You'll Learn

Python Programming, Linear Programming (LP), Np-Completeness, Dynamic Programming

Reviews

4.6 (558 ratings)
  • 5 stars
    71.32%
  • 4 stars
    19.71%
  • 3 stars
    5.37%
  • 2 stars
    1.79%
  • 1 star
    1.79%
CS
Aug 25, 2019

Very Very Challenging Course , it test your patience and rewards is extremely satisfying. Lot of learning on a complicated subject of NP-Hard problems.

AS
Jun 14, 2018

Another great course in this specialization with challenging and interesting assignments. However, this one is somewhat harder but rewarding.

From the lesson
NP-complete Problems

Taught By

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.