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

Simple item page
dc.creatorDiaby, Moustapha
dc.date2006-11-16
dc.date2006-11-16
dc.date.accessioned2026-07-07T07:31:43Z
dc.date.available2026-07-07T07:31:43Z
dc.descriptionWe show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.
dc.description7 pages; 5 figures
dc.identifierhttps://arxiv.org/abs/cs/0611074
dc.identifierhttp://arxiv.org/abs/cs/0611074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/118853
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.2; F.2.2
dc.titleOn "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
dc.typetext

Files

Collections

arXiv