Fast Exact Method for Solving the Travelling Salesman Problem
计算复杂性
2007-05-23 v1
摘要
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.
引用
@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}
}
备注
4 pages, 4 figures