A Polynomial Time Algorithm for The Traveling Salesman Problem
Sergey Gubin
TL;DR
This paper presents a polynomial time algorithm for solving the Traveling Salesman Problem, leveraging the asymmetric polytope representation to efficiently find optimal tours.
Contribution
It introduces a novel polynomial time algorithm based on the ATSP polytope, advancing the understanding of TSP complexity.
Findings
Polynomial time solution for TSP demonstrated
ATSP polytope expressed by asymmetric polynomial size LP
Implications for TSP complexity theory
Abstract
The ATSP polytope can be expressed by asymmetric polynomial size linear program.
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
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Vehicle Routing Optimization Methods