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
Enterprise-grade ITSM, for every business Icon
Enterprise-grade ITSM, for every business

Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it 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

Python, C

Related Categories

Python Algorithms, C Algorithms

Registered

2007-05-21