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

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/118853We show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.7 pages; 5 figuresComputational ComplexityDiscrete MathematicsF.2; F.2.2On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"text