jacob's ladder for the tsp
Description
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.
Categories
License
Update Notifications
User Reviews
Be the first to post a review of jacob's ladder for the tsp!