Reload

Automatic version	Traveling Salesman problem (end point coincides with start point)	end point differs from start point	start point is given and end point is arbitrary	start point and end point are given
	Traveling Salesman problem by incremental method			by using Hilbert Curve
				by using Approximating polygon of Hilbert Curve
Click version	Traveling Salesman problem (end point coincides with start point)	end point differs from start point	start point is given and end point is arbitrary	start point and end point are given
	TSP with a lot of time

Screensaver

Traveling salesman problem's heauristic algorithm(Open 24/Nov/2001 : The 4th Revision Sunday, 16-Nov-2003 23:08:10 JST)
References
Gerhart Reinelt, Springer-Verlag, Traveling Salesman - Comunicational Solutions for TSP Applications - Lecture Notes in Computer Science 840
E.L.Lawler, J.K.Lenstra, A.H.G.Rinnooy Kan, D.B.Shmoys���AWILEY, The Traveling Salesman Problem
notsp.java
tspa.lzh(VB Codes)

---

If you have a message, don't hesitate to send it by using
E-mail:Mail Form
or
BBS

---

English Home of Takashi Ohyama
Japanese Home of Takashi Ohyama