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

Moustapha Diaby

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

Computational Complexity 2007-05-23 v2 Discrete Mathematics

Authors: Moustapha Diaby

View on arXiv ↗ PDF ↗

Abstract

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

Keywords

P vs NP traveling salesman problem linear programming formulation counter-example

Cite

@article{arxiv.cs/0611074,
  title  = {On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"},
  author = {Moustapha Diaby},
  journal= {arXiv preprint arXiv:cs/0611074},
  year   = {2007}
}