We consider the problem of finding a minimum weight Hamiltonian circuit in a weighted undirected graph. If the edge weights are non-negative and satisfy the triangle inequality, there are heuristics ...