欧氏旅行售货员问题是对给定的平面上n 个点确定一条连接这n 个点的长度最短的哈密顿回路。-Euclidean traveling salesman problem is a given n points in the plane of a connection to determine the length of these n points the shortest Hamiltonian circuit.