title: What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?
body: <p>I would like to know what is the problem name for TSP w/o considering the way of going back to starting point and what is the algorithm to solve this.</p>
  <p>I looked into Shortest path problem but that is not what I am looking for, the problem only find the shortest path from 2 assigned points. But what I am looking for is the problem which we give n points and inputting only 1 starting point. Then, find the shortest path traveling all points exactly once. (end point can be any point.)</p>
  <p>I also looked into Hamiltonian path problem but it seems not to solve my defined problem but rather find whether there is Hamiltonian path or not.</p>