Given a set of Y Points (locations) with Longitude and Latitude, what is the shortest path that crosses a Unique set of X points?

Just a algorithm problem I was having when designing a database. Not sure how to proceed or if there is an elegant solution to this problem. Please help! Thanks!

Edit: This is not the Travelling Salesmen Problem, it is not the shortest path visiting ALL the locations, but just any unique set that crosses X points.

For example, if we had 2000 locations, what's the shortest path that will visit any 10 locations?

The size of X will be very small compared to the overall set of Y.