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:
Bibliographic Details
Published inEuropean journal of operational research Vol. 26; no. 2; pp. 262 - 265
Main Author Korner, Frank
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 1986
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Graphs
Heuristic
heuristic solution
Mathematical models
Matrix
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Salespeople
Travel
Traveling salesman problem
Traveling salesman problem
heuristic solution
Travelling salesman problem
Combinatorial programming
Heuristic method
Combinatory problem
Online AccessGet full text

Cover

More Information
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