On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"

Details On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example" On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"

2006-11-16

arxiv.org/abs/cs/0611074v2

Computer Science

Computational Complexity

7 pages; 5 figures

Scientific paper

We show that Hofman's claim of a "counter-example" to Diaby's LP formulation
of the TSP is invalid.

Affiliated with

Also associated with

No associations

Rating

On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example" 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 On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622832