Methods for Decision Making in an Uncertain Environment - Specific Max. Traveling Salesman Problems. Vol. 6, Nº 3, pp.13-32, 2012

Congress

Summary *

We single out every longest path of order that solves each of the Longest Euclidean Hamiltonian Path Problems (Max. Traveling Salesman Path Problems) on the even -th roots 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. Information provided by the agent in SIGEVA