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

Simple item page
dc.creatorHofman, Radoslaw
dc.date2006-10-20
dc.date2006-11-02
dc.date.accessioned2026-07-07T07:27:54Z
dc.date.available2026-07-07T07:27:54Z
dc.descriptionThis 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"
dc.descriptionThis version contain more figures, and clearer way to explain counter example idea for k dimensions
dc.identifierhttps://arxiv.org/abs/cs/0610125
dc.identifierhttp://arxiv.org/abs/cs/0610125
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117542
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectF.2
dc.titleReport on article: P=NP Linear programming formulation of the Traveling Salesman Problem
dc.typetext

Files

Collections

arXiv