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
MongoDB Atlas runs apps anywhere Icon
MongoDB Atlas runs apps anywhere

Deploy in 115+ regions with the modern database for every enterprise.

MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
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