Fast Exact Method for Solving the Travelling Salesman Problem

Simple item page
dc.creatorYatsenko, Vadim
dc.date2007-02-23
dc.date.accessioned2026-07-07T07:48:26Z
dc.date.available2026-07-07T07:48:26Z
dc.descriptionThis 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.
dc.description4 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0702133
dc.identifierhttp://arxiv.org/abs/cs/0702133
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124496
dc.subjectComputational Complexity
dc.subjectI.2.8; G.1.6
dc.titleFast Exact Method for Solving the Travelling Salesman Problem
dc.typetext

Files

Collections

arXiv