This paper offers an exact algorithm for the classic travelling salesman problem, the computational results show that it has some obvious advantages and practical applications.
本文对经典的旅行商问题给出一种精确式算法,计算结果表明,它具有一定的优越性和实用性。
Many questions of biology and chemistry can be reduced to versions of the travelling salesman problem, where the challenge is to find the most efficient solution among a whole host of possibilities.