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:
Easy subject (which starts with 'about nirarebakun.com') to understand, please.
Because I'm afraid to get a virus mail or ad-mail, I delete the mail if the subject is abnormal.
Good example for subject:
About nirarebakun.com:Voronoi diagram
About nirarebakun.com:I'm interested in Steiner problem
Bad example for subject:
'Hello', 'Thank you', 'How do you do', 'Please', 'I love you', 'Re', 'Document', 'Excel file', 'Product' and so on.
And don't attach the file when you send the first mail.
or
BBS

---

English Home of Takashi Ohyama
Japanese Home of Takashi Ohyama