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.

Project Activity

See All Activity >

Categories

Algorithms

License

Public Domain

Follow jacob's ladder for the tsp

jacob's ladder for the tsp Web Site

Other Useful Business Software
AestheticsPro Medical Spa Software Icon
AestheticsPro Medical Spa Software

Our new software release will dramatically improve your medspa business performance while enhancing the customer experience

AestheticsPro is the most complete Aesthetics Software on the market today. HIPAA Cloud Compliant with electronic charting, integrated POS, targeted marketing and results driven reporting; AestheticsPro delivers the tools you need to manage your medical spa business. It is our mission To Provide an All-in-One Cutting Edge Software to the Aesthetics Industry.
Learn More
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of jacob's ladder for the tsp!

Additional Project Details

Intended Audience

Science/Research

Programming Language

C, Python

Related Categories

Python Algorithms, C Algorithms

Registered

2007-05-21