On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

DOI10.1016/0377-2217(86)90188-8zbMath0595.90091OpenAlexW1966089951MaRDI QIDQ1078097

Frank Koerner

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90188-8

zbMATH Keywords

heuristicsapproximation algorithmsminimum and the maximum traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (3)

Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem ⋮ An improved approximation algorithm for the maximum TSP ⋮ Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• On the refinement of bounds of heuristic algorithms for the traveling salesman problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Approximate Traveling Salesman Algorithms
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Some Examples of Difficult Traveling Salesman Problems
• Travelling Salesman and Assignment Problems: A Survey
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems

This page was built for publication: On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem