travelling salesman problem (tsp)

Minimize the sum of pair distances for a system of particles N-space. This project is to approximate the smallest sum of pair distances among particles, where distances are calculated pairwise and every particle is the only counted once