algorithm - What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point? -
algorithm - What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point? -
i know problem name tsp w/o considering way of going starting point , algorithm solve this.
i looked shortest path problem not looking for, problem find shortest path 2 assigned points. looking problem give n points , inputting 1 starting point. then, find shortest path traveling points once. (end point can point.)
i looked hamiltonian path problem seems not solve defined problem rather find whether there hamiltonian path or not.
please suggest me, give thanks you!
i've found reply question in this book. same computer wiring problem occurs repeatedly in design of computers , other digital systems. purpose minimize total wire length. so, indeed minimum length hamiltonian path.
what book suggests create dummy point distances every other points 0. therefore, problem becomes (n+1)-city symmetric tsp. after solving, delete dummy point , minimum length hamiltonian path solved , can tsp path without returning start point.
algorithm graph-algorithm traveling-salesman np-hard
Comments
Post a Comment