Definition
Metric Travelling Salesman Problem
A travelling salesman problem is called metric if the distance matrix
satisfies the triangle inequality, i.e., for all nodes , the following holds:
Metric Travelling Salesman Problem
A travelling salesman problem is called metric if the distance matrix
satisfies the triangle inequality, i.e., for all nodes , the following holds: