A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
VERSION HISTORY
- Version jacob_s%20ladder%20for%20the%20tsp posted on 2007-05-26
Several fixes and updates - Version N/A posted on 2007-05-26
Program Details
- Category: Development > Other
- Publisher: jacobs-ladder.sf.net
- License: Free
- Price: N/A
- Version: Array
- Platform: windows