Demarkko矩阵上的旅行推销员路
Travelling salesman paths on Demidenko matrices
摘要：
在路径版本的旅行推销员问题（Path-TSP）中，推销员正在寻找通过n个城市的最短哈密尔顿路径。推销员必须从一个给定的城市开始他的旅程，访问每个城市一次，最后在另一个给定的城市结束他的旅程。在本文中，我们确定了一个新的多项式可解的情况下的路径TSP的距离矩阵的城市是一个所谓的Demarkko矩阵。我们确定了一些关键的最优解的组合属性，我们设计了一个动态的时间复杂度$O(n^6)$的计划。
英文摘要：
In the path version of the Travelling Salesman Problem (Path-TSP), a salesman is looking for the shortest Hamiltonian path through a set of n cities. The salesman has to start his journey at a given city s, visit every city exactly once, and finally end his trip at another given city t. In this paper we identify a new polynomially solvable case of the Path-TSP where the distance matrix of the cities is a so-called Demidenko matrix. We identify a number of crucial combinatorial properties of the optimal solution, and we design a dynamic program with time complexity $O(n^6)$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
