I am looking for the method / correct way to approach to reduce the traveling salesman problem to an instance of traveling salesman problem which satisfies the triangle inequality, ie:$D(a, b) \leq D(a, c) + D(c, b)$I am not sure how to attack this kind of problem, so any pointers / explanations regarding this would be helpful. Thank you.
Guidelines to reduce general TSP to Triangle TSP
cc.complexity theory;np hardness;np;tsp;hamiltonian paths