Algorithms Traveling Salesman suggest change

Travelling Salesman

Remarks

The Travelling Salesman Problem is the problem of finding the minimum cost of travelling through N vertices exactly once per vertex. There is a cost cost[i][j] to travel from vertex i to vertex j.

There are 2 types of algorithms to solve this problem: Exact Algorithms and Approximation Algorithms

Exact Algorithms

  1. Brute Force Algorithm
  2. Dynamic Programming Algorithm

Approximation Algorithms

To be added

Feedback about page:

Feedback:
Optional: your email if you want me to get back to you:



Table Of Contents