Metric Travelling Salesman Problem

computation

Definition

Metric Travelling Salesman Problem

A travelling salesman problem is called metric if the distance matrix $C$ satisfies the triangle inequality, i.e., for all nodes $i,j,k$, the following holds:

$$c_{ik}\le c_{ij}+c_{jk}$$