The Asymmetric Traveling Salesman Problem

Details The Asymmetric Traveling Salesman Problem The Asymmetric Traveling Salesman Problem

2006-12-05

arxiv.org/abs/math/0612114v2

Mathematics

General Mathematics

PDF. WORD 2000, 2 pages.The following error in the proof of theorem 1 has been corrected: "a negatively-valued cycle in M(s)"

Scientific paper

Starting with M(a), an n X n asymmetric cost matrix, Jonker and Volgenannt transformed it into a 2n X 2n symmetric cost matrix, M(s)where M(s) has unusual properties. One such property is that an optimal tour in M(s) yields an optimal tour in M(a). Modifying M(s), we apply the modified Floyd-Warshall algorithm to M(s). Due to the structure of M(s), we hopefully)can always obtain an optimal tour in M(a) in polynomial time.If theorem 1 in this paper is valid, since the asymmetric traveling salesman problem is NP-hard, P would equal NP.

Affiliated with

Also associated with

No associations

Rating

The Asymmetric Traveling Salesman Problem 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 The Asymmetric Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Asymmetric Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452742