2017
DOI: 10.13053/rcs-138-1-16
|View full text |Cite
|
Sign up to set email alerts
|

The Mexican Magical Towns Traveling Salesman Problem: Preliminary Results

Abstract: The Traveling Salesman Problem (TSP) is a classical NPhard combinatorial problem that has been intensively studied through several decades. A large amount of literature is dedicated to this problem. TSP can be directly applied to some real life problems, and to be generalized to some other set of important combinatorial problems. Nowadays, a large collection of TSP instances can be found such as TSPLIB and National TSP webpage, among others. In this paper we experiment with a different TSP instance, that is, a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
(18 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?