Fast Exact Method for Solving the Travelling Salesman Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Computational Complexity, I.2.8; G.1.6

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/124496

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0702133
 http://arxiv.org/abs/cs/0702133

Collections

arXiv