Jump to content

Concorde TSP Solver

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Steinhauser.myles (talk | contribs) at 20:00, 28 March 2008 (Created basic page.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The CONCORDE is an algorithm commonly used to solve problems like the Traveling Salesman Problem.

[1] [1]

  1. ^ CONCORDE solves Traveling Salesman Problem