Given n sets of points in the plane find the shortest path which passes from exactly one point from each set
This problem is a generalization of TSP known as Set TSP. Not surprisingly, it is both NP-complete and well-studied.