Even with a traveling salesman problem you can get "near-optimal" results with a... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

Wilduck on March 23, 2012 | parent | context | favorite | on: You used Python for what?

Even with a traveling salesman problem you can get "near-optimal" results with an algorithm that has a reasonable run time. It's still important to note that you have such a problem though, as the fact that you're settling for "near optimal" needs to be understood.

cschmidt on March 23, 2012 [–]

You can actually find the global optimal solution for surprisingly large real world instances. They do tens of thousands of cities.

Lots of interesting stuff here. The Concorde solver is probably the state of the art. http://www.tsp.gatech.edu/concorde/index.html

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact