A Polynomial Time Algorithm for The Traveling Salesman Problem
Sergey Gubin
Abstract
The ATSP polytope can be expressed by asymmetric polynomial size linear program.
Create a lesson
Related papers
The Project Scheduling Interdiction Problem with Delay Groups
Fei Wu, Erik Demeulemeester, Jannik Matuschke
Rank-Three Projections and Minimal Multiplicity Bipartitions of Path Complements
Jintao Fei, Jiangying Luo
Faster FPRAS for the Permanent via Restricted Poincaré Inequalities and Coupled Flows
Xiaoyu Chen, Eric Vigoda, Xiongxin Yang
On identifying codes on oriented graphs
Soura Sena Das, Sagnik Sen
Parallelizable Gradient-Based Optimization For Multi-Objective MaxCut
Jingjuan Huang, Alvaro Velasquez, Jia Liu et al.
Algebraic Characterizations for Minors of Finite Graphs via Flow Transformation Monoid Division and Embedding
Amena Assem, Hanna Derets, Chrystopher L. Nehaniv