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.
Ratings and Reviews
Be the first to post a text review of jacob's ladder for the tsp. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Project Feed
-
first loss
first loss came from eil51. correct solution was 426, best path found was 427. No bugs it was a fair loss.
-
jacobs-ladder jacob's ladder for the tsp file released: tsp.zip
only the python version is include for now
-
File released: /jacobs-ladder/jacob_s ladder for the tsp/tsp.zip
-
bays29 and swiss 42 down!
bays29 and swiss42 have been optimally solved processor: old budget processor time: not so long contributor: project admin
-
File released: /jacobs-ladder/jacob_s ladder for the tsp/python_version.zip
-
jacobs-ladder jacob's ladder for the tsp file released: python_version.zip
only the python version is include for now
Rate and Review
Be the first person to add a text review.
Related Projects
-
Vrapper
Vrapper is an eclipse plugin which acts as a wrapper for existing eclipse text editors to provide a Vim-like input scheme for moving around and editing text. Eclipse Update Site: http://vrapper.sourceforge.net/update-site/stable
-
-
jacob's ladder for the tsp Actions
About SourceForge
Develop Software
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
