paper

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

arXiv:cs/0611074

Abstract

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

7 pages; 5 figures

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