EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS

被引：0

作者：

Niel, Blanca I. ^{[1
]}

机构：

[1] UNS, Dept Matemat, Ave Alem 1253,B8000CPB, Bahia Blanca, Buenos Aires, Argentina

来源：

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2012年 / 4卷 / 04期

关键词：

Hamiltonian path; extremal problems; Euclidean geometric problem; furthest neighbor tours; Traveling salesman problem;

D O I：

10.1142/S1793830912500577

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We single out every longest path of n-1 order that solves each of the n/2 Longest Euclidean Hamiltonian Path Problems on the even nth root of the unity, by means of a geometric and arithmetic procedure. This identification is done regardless of planar rotations and orientation. In addition, the uniqueness of the Euclidean Hamiltonian cycle that resolves the Maximum Traveling Salesman Problem is shown.

引用

页数：16