首页/论文/math/0410361

arXiv math/04103612004-10-16math.CO

Floyd-WarshallAlgorithm和非对称TSP

The Floyd-WarshallAlgorithm and the Asymmetric TSP

Howard Kleiman

备注：: PDF, 105 pages

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

摘要：

我们改进了“Floyd-Warshall算法、AP和TSP（III）”中的证明。我们还简化了获得一个很好的上界的最优解的方法。

英文摘要：

We improve proofs in "The Floyd-Warshall Algorithm, the AP and the TSP (III). We also simplify the method for obtaining a good upper bound for an optimal solution.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Floor-Warshall算法、AP和TSP III

The Floyd-Warshall Algorithm, the AP and the TSP III

我们澄清了在“The Floor-Warshall Algorithm，the AP and the TSP”中关于第2阶段和第3a阶段的论述。我们还改进和简化了定理3.6 .为了澄清说明，我们改变了“Floor-Warshall算法，AP和TSP II”的示例3.4和3.5中的矩阵。

2002-12-21math.CO

Floor-Warshall算法、AP和TSP，第II部分

The Floyd-Warshall Algorithm, the AP and the TSP, Part II

在math.CO/0111309中，我们使用了容许排列和Floor-Warshall算法的一个变体来获得指派问题的最优解和流动推销员问题的近似解。在这里，我们给出了一个大的，详细的说明如何应用算法。

2001-12-06cs.DSmath.CO

Floor-Warshall算法、AP和TSP

The Floyd-Warshall Algorithm, the AP and the TSP

我们使用容许排列和一个变体的Floor-Warshall算法获得一个最优解的分配问题。利用F-W算法的另一种变体，我们得到了流动推销员问题的近似解。我们还给出了该近似解是最优解的一个充分条件。

2001-11-29cs.DSmath.CO

更优的不对称TSP近似保证

Better approximation guarantee for Asymmetric TSP

Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics, University of Bonn（波恩大学离散数学研究所与哈道夫数学中心）

本文改进了不对称TSP的近似比，低于15，并在无权有向图和给定端点的最小成本巡回问题中获得更优比值，同时改进了自然线性规划松弛的积分比上界。

2026-03-15cs.DSmath.CO

以准多项式时间几乎必然性精确求解随机非对称旅行商问题

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p

Carnegie Mellon University（卡内基梅隆大学）

本文提出一种在准多项式时间内几乎必然性精确求解随机非对称旅行商问题的算法。

2026-07-28cs.DSmath.CO

Solving a new application of asymmetric TSP by modified migrating birds optimization algorithm

In this study, we first introduce a new application of the asymmetric traveling salesman problem (ATSP) which is about a small restaurant with one cook and a single stove. Once a meal has started cooking on the stove, the cook prepares the next meal on the table where the preparation time is dependent on the previous meal prepared. For the solution of this problem, besides several simple construction algorithms and a new version of the simulated annealing algorithm, we focus on enhanced versions of the recently introduced migrating birds optimization (MBO) algorithm. The original MBO algorithm…

2023-01-12math.COmath.OC

更多相关论文收起更多论文

New Inapproximability Bounds for TSP

In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP) and prove new explicit inapproximability bounds for that problem. The best up to now known hardness of approximation bounds were 185/184 for the symmetric case (due to Lampis) and 117/116 for the asymmetric case (due to Papadimitriou and Vempala). We construct here two new bounded occurrence CSP reductions which improve these bounds to 123/122 and 75/74, respectively. The latter bound is the first improvement in more than a decade for the case of the asymmetric TSP. One of our main tools, which may be of…

2013-06-10cs.CCcs.DMcs.DS

The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP

Marcus, Spielman, and Srivastava in their seminal work \cite{MSS13} resolved the Kadison-Singer conjecture by proving that for any set of finitely supported independently distributed random vectors $v_1,\dots, v_n$ which have "small" expected squared norm and are in isotropic position (in expectation), there is a positive probability that the sum $\sum v_i v_i^\intercal$ has small spectral norm. Their proof crucially employs real stability of polynomials which is the natural generalization of real-rootedness to multivariate polynomials. Strongly Rayleigh distributions are families of probabili…

2015-07-22cs.DSmath.COmath.PR

Reassembling trees for the traveling salesman

Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written as convex combination of spanning trees. The main argument then is that randomly sampling a tree from such a distribution and then completing the tree to a tour at minimum cost yields a better approximation guarantee than simply taking a minimum cost spanning tree (as in Christofides' algorithm). We argue that an additional step can help: reassembling the sp…

2016-01-05cs.DMcs.DSmath.CO