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 with a lot of time(Click version)(Open 25/Mar/2007 : The 0th Revision Sunday, 25-Mar-2007 19:58:24 JST)

In this page, we can find the shortest route passing through the points you clicked.
Please click black screen. When you click more than 4 points, the screen shows the shortest route to pass through the points. But if the points are a lot (about more than 10), it takes a lot of time to obtain the solution, sorry.

tsploopcli.java

---

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