Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem

Details Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem

2006-10-20

arxiv.org/abs/cs/0610125v4

Computer Science

Computational Complexity

This version contain more figures, and clearer way to explain counter example idea for k dimensions

Scientific paper

This article presents counter examples for three articles claiming that P=NP. Articles for which it applies are: Moustapha Diaby "P = NP: Linear programming formulation of the traveling salesman problem" and "Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem", and also Sergey Gubin "A Polynomial Time Algorithm for The Traveling Salesman Problem"

Affiliated with

Also associated with

No associations

Rating

Report on article: P=NP Linear programming formulation of the 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 Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361766