Would this be useful to any of you?

I'm curious. Could this be modified to find the shortest route that visits each point and returns to the starting point?

For example.
If you have points A, B, C, D, and E. What is the shortest route starting at A, visiting all points, and returning back to A.

I tried doing this a ways back, and found that it IS possible, but the time taken to calculate the result increases exponentially VERY FAST, so that it becomes useless to calculate anything over about 10 points (i forget the number exactly).