Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: N-City Traveling Salesman Problem: Optimization by Simulated Annealings
Авторы: Randelman R.E., Grest G.S.
The problem of finding the shortest closed path connecting N randomly chosen points is one of the classic Np-complete problems. We show that the length of tour depends logarithmically on the cooling rate Q in a simulated Monte Carlo anneal. We speculate that this is a general property of all Np-complete problems.