YoVDO

Traveling Salesman Problem Using Dynamic Programming - Directed Graph Example

Offered By: Sundeep Saradhi Kanthety via YouTube

Tags

Dynamic programming Courses Graph Theory Courses Algorithm Design Courses Computational Complexity Courses Traveling Salesman Problem Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Learn how to solve the Traveling Salesman Problem using dynamic programming in this 26-minute video tutorial. Explore the application of dynamic programming techniques to find the optimal solution for the classic Traveling Salesman Problem on a directed graph. Follow along with a step-by-step example to understand the implementation and analysis of this algorithm in the context of Design and Analysis of Algorithms (DAA).

Syllabus

Traveling Salesman Problem using Dynamic Programming with Example (Directed Graph) || DAA


Taught by

Sundeep Saradhi Kanthety

Related Courses

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera Discrete Optimization
University of Melbourne via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera