Report on article: P=NP Linear programming formulation of the Traveling Salesman Problem
Radoslaw Hofman
TL;DR
This paper critiques three articles claiming P=NP by providing counterexamples to their linear programming formulations of the Traveling Salesman Problem, challenging their conclusions.
Contribution
It presents counterexamples that disprove the claims of P=NP in the analyzed linear programming approaches.
Findings
Counterexamples invalidate the linear programming formulations.
Claims of P=NP based on these formulations are incorrect.
The paper refutes previous assertions of polynomial-time solutions.
Abstract
This 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"
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Optimization and Mathematical Programming · Vehicle Routing Optimization Methods