2007/02/23 by Vadim Yatsenko, Yatsenko, Vadim · 1 citation
Computer Science · Engineering · #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Computer and information sciences #G.1.6 #I.2.8 #Optimization and Packing Problems #cs.CC
paper · pdf · doi:10.48550/arxiv.cs/0702133
4 pages, 4 figures
arxiv created 2007/02/23 · openalex publication_date 2007/02/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper describes TSP exact solution of polynomial complexity. It is considered properties of proposed method. Effectiveness of proposed solution is illustrated by outcomes of computer modeling.