[OSM-talk] Path with Pit Stops

Steve Bennett stevagewp at gmail.com
Fri Feb 11 23:34:48 GMT 2011

On Sat, Feb 12, 2011 at 9:43 AM, Gregory <nomoregrapes at googlemail.com> wrote:
> Actually I got in the 2nd year of my ugrad Computer Science course.
> I like to remind people it is impossible* to solve** the travelling salesman
> for even 10 cities without spending several years of computer processing.

Well, 20 cities maybe. 10 only gives 3.6 million possible routes,
computable in under a second.

Anyway, there's also this to look at:



More information about the talk mailing list