Travelling Salesman Problem by Dynamic Programming

THIS FUNCTION ENHANCE TSP USING DYNAMIC PROGRAMMING FUNCTION, tsp_dp1.m (Elad Kivelevitch,2011)

DATA FROM TXT FILES ARE RETRIVED AND SOLVE USING tsp.dp1.m
DESCRIPTION OF VARIABLES
n : number of cities
coor : txt file-name of coordinates, i.e. 'coor.txt'
dist : txt file-name of distance between cities, i.e. 'dist.txt'
city : txt file-name of cities' name, i.e. 'city.txt'
TXT FILES NEEDED:
1) coor.txt
* table of n-by-2 matrix
* first column contains latitude of each cities
* second column contains longitude of each cities
2) dist.txt
* table of n-by-n matrix
* each element represent distance between two cities
* all diagonal elements must be Inf
3) city.txt
* table of n-by-1 vector
* each row hold the name of cities
* name of cities cannot contain any spaces or symbols