Re: Special query type for Spatial DB

From: Paul <paul_at_not.a.chance.ie>
Date: Fri, 16 Jan 2004 16:24:17 -0000
Message-ID: <MPG.1a722089f01e8bc79898a1_at_news1.eircom.net>

hobbit_at_southern_seaweed.com.op says...

> WTF is the travelling salesman problem?

Google is your friend. 1st site.

---

The traveling salesman problem, or TSP for short, is this: given a finite number of "cities" along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point. In these pages we report on our ongoing project to solve large-scale instances of the TSP.

---

The "problem" is that there is (as yet) no formula for solving this problem - you have to test all possible combinations. There are mathematical techniques for dealing with this problem, but the "problem" for the maths heads is that no solution that they can produce is *_proveably_* correct.

Paul...

> Pete Brown

-- 
plinehan  y_a_h_o_o  and d_o_t  com
C++ Builder 5 SP1, Interbase 6.0.1.6 IBX 5.04 W2K Pro
Please do not top-post.

"XML avoids the fundamental question of what we should do, 
by focusing entirely on how we should do it." 

quote from http://www.metatorial.com 

Received on Fri Jan 16 2004 - 17:24:17 CET