Fast Exact Method for Solving the Travelling Salesman Problem

Abstract

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.

4 pages, 4 figures

Cited by in corpus (1)

• Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem