Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem
Computational Complexity
2007-05-23 v4 Discrete Mathematics
Data Structures and Algorithms
Abstract
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"
Cite
@article{arxiv.cs/0610125,
title = {Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem},
author = {Radoslaw Hofman},
journal= {arXiv preprint arXiv:cs/0610125},
year = {2007}
}
Comments
This version contain more figures, and clearer way to explain counter example idea for k dimensions