English

Fast Exact Method for Solving the Travelling Salesman Problem

Computational Complexity 2007-05-23 v1

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.

Keywords

Cite

@article{arxiv.cs/0702133,
  title  = {Fast Exact Method for Solving the Travelling Salesman Problem},
  author = {Vadim Yatsenko},
  journal= {arXiv preprint arXiv:cs/0702133},
  year   = {2007}
}

Comments

4 pages, 4 figures