Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP)

Details Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP) Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP)

2012-04-11

arxiv.org/abs/1204.2350v1

Computer Science

Other Computer Science

Scientific paper

The author would like to propose a simple but yet effective method, convex layers, nearest neighbor and triangle inequality, to approach the Traveling Salesman Problem (TSP). No computer is needed in this method. This method is designed for plain folks who faced the TSP everyday but do not have the sophisticated knowledge of computer science, programming language or applied mathematics. The author also hopes that it would give some insights to researchers who are interested in the TSP.

Affiliated with

Also associated with

No associations

Rating

Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716884