Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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"
This version contain more figures, and clearer way to explain counter example idea for k dimensions

Keywords

Computational Complexity, Discrete Mathematics, Data Structures and Algorithms, F.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/117542

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0610125
 http://arxiv.org/abs/cs/0610125

Collections

arXiv