image thumbnail

updated 3 years ago

Dynamic Programming solution to the TSP by Elad Kivelevitch

This function solves the Traveling Salesman Problem (TSP) using Dynamic programming (DP). (optimization, tsp, dynamic programming)

[OptimalTour,mincost]=tsp_dp1(cities, Dmatrix)

Contact us