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
Earn up to 16% annual interest with Nexo. Icon
Earn up to 16% annual interest with Nexo.

Access competitive interest rates on your digital assets.

Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
Get started with Nexo.
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