Science and Technology Production
Specific Max. Traveling Salesman Problems
Book Chapter
Authorship:
RAUL OSCAR DICHIARADate:
2012Publishing House and Editing Place:
World Scientific Proceedings Series on Computer Engineering and Information Science - Vol. 6Book:
Methods for Decision Making in an Uncertain Environments (pp. 13-32)World Scientific Proceedings Series on Computer Engineering and Information Science - Vol. 6
ISBN:
978-981-4415-76-7Summary *
Abstract We single out every longest path of n−1 order that solves each of the n 2 LongestEuclidean Hamiltonian Path Problems (Max. Traveling Salesman Path Problems)on the even n−th root of the unity, by means of a geometric and arithmetic procedure. This identification is done regardless planar rotations and orientation. In addition, the uniqueness of the Euclidean Hamiltonian cycle that resolves the Maximum Traveling Salesman Problem is shown. Information provided by the agent in SIGEVAKey Words
Nearest and Farthest Neighbor algorithmLogistic strategiesTraveling Salesman ProblemFully connected networks.