A generating function approach to the Traveling Salesman Problem
A generating function approach to the Traveling Salesman Problem
复制标题
旅行商问题的生成函数方法
DOI：
--
复制
发表时间：
1977
期刊：
影响因子：
--
通讯作者：
M. Kohn
中科院分区：
文献类型：
--
作者：
S. Kohn;A. Gottlieb;M. Kohn
基于生成功能的新的确定性方法是针对生成功能的。这个成本。我们以接近o的特定价值评估G（x），并使用对数技术，提取最小的指数，即最小的旅行成本。对于N2值（可能很高）。
A new deterministic approach to the (assymetric) Traveling Salesman Problem based on generating functions is introduced. Specifically, we produce a function G(x)=Σαix ei where each ei is the cost of a possible tour and αi is the number of tours having this cost. Evaluating G(x) at a specific value close to O and using a logarithmic technique, we extract the smallest exponent, i.e., the minimal tour cost. For an n city problem the method requires on the order of n32n steps and storage for n2 values (possibly of high precision). This technique should be applicable to other “NP” problems.