algorithm 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
- Brute Force Algorithm
- Dynamic Programming Algorithm
Approximation Algorithms
To be added
