On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
We consider the relationship between the minimum and the maximum traveling salesman problem. The paper is based on the idea of applying heuristics for the maximum traveling salesman problem to the minimum traveling salesman problem. Numerical results confirm the efficiency of the proposed method.
Saved in:
Published in | European journal of operational research Vol. 26; no. 2; pp. 262 - 265 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
1986
Elsevier Elsevier Sequoia S.A |
Series | European Journal of Operational Research |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We consider the relationship between the minimum and the maximum traveling salesman problem. The paper is based on the idea of applying heuristics for the maximum traveling salesman problem to the minimum traveling salesman problem. Numerical results confirm the efficiency of the proposed method. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0377-2217 1872-6860 |
DOI: | 10.1016/0377-2217(86)90188-8 |