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
Build Agents and Models on One Platform Icon
Build Agents and Models on One Platform

Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
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

C, Python

Related Categories

Python Algorithms, C Algorithms

Registered

2007-05-21