Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem
<|reference_start|>Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem: 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"<|reference_end|>
@article{hofman2006report,
    title={Report on article: P=NP Linear programming formulation of the Traveling
  Salesman Problem},
    author={Radoslaw Hofman},
    journal={arXiv preprint arXiv:cs/0610125},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0610125},
    primaryClass={cs.CC cs.DM cs.DS}
}