Dynamic Programming solution to the TSP
This function solves the Traveling Salesman Problem (TSP) using Dynamic programming (DP).
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
The function is based on the paper by Held and Karp from 1962. The DP is guaranteed to provide the accurate (optimal) result to the TSP, but the time complexity of this algorithm is O(2^n n^2), which limits the use of this algorithm to 15 cities or less.
NOTE: For reasonable runtime, please do not try to calculate a tour of more than 13 cities. DP is not for large sets of cities.
Cite As
Elad Kivelevitch (2026). Dynamic Programming solution to the TSP (https://ch.mathworks.com/matlabcentral/fileexchange/31454-dynamic-programming-solution-to-the-tsp), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired: Travelling Salesman Problem by Dynamic Programming
General Information
- Version 1.0.0.0 (3.04 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
