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

Authors

Diaby, Moustapha

Description

We show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.
7 pages; 5 figures

Keywords

Computational Complexity, Discrete Mathematics, F.2; F.2.2

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections