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

2006/11/16 by Moustapha Diaby, Diaby, Moustapha
Economics, Econometrics and Finance · Business, Management and Accounting · Decision Sciences · #Game Theory and Voting Systems #Supply Chain and Inventory Management #Auction Theory and Applications

paper · pdf · doi:10.48550/arxiv.cs/0611074

Abstract

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

Related

• A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"
• Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem
• Report on article The Travelling Salesman Problem: A Linear Programming Formulation
• The traveling salesman problem: A Linear programming formulation
• Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem