Chinese postman problem, but where the postman have to visit each vetex at least once.
Is there a name for this problem?
What is the ideal algorithm to solve this problem?
Let $G$ be an edge-weighted graph. Create a new graph $G'$ in which the weight of the edge $(x,y)$ is the cost of the shortest path between $x$ and $y$ in $G$. The problem you are interested in is the traveling salesman problem (TSP) on $G'$.