Method of scaling in approximate solution of the traveling salesman problem

Authors:
E. E. Ivanko
Affiliations:
Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia
Venue:
Automation and Remote Control
Year:
2011

Citing 4
Cited 0

Asymptotic experimental analysis for the Held-Karp traveling salesman bound

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Data clustering: a review

ACM Computing Surveys (CSUR)
A heuristic for the pickup and delivery traveling salesman problem

Computers and Operations Research
8/7-approximation algorithm for (1,2)-TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Quantified Score

Hi-index	0.00

Visualization

Abstract

An empirical algorithm to solve the traveling salesman problem was proposed. It is distinguished for the consecutive rational decomposition of the given task into subtasks of lower dimensions. Each subtask can be solved using any existing method, exact or empirical, including the recursively applied algorithm described in the present paper.