On the refinement of bounds of heuristic algorithms for the traveling salesman problem

DOI10.1007/BF01585662zbMath0564.90040OpenAlexW4251552671MaRDI QIDQ3678965

Bernd Jeromin, Frank Koerner

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585662

zbMATH Keywords

heuristicstraveling salesmanapproximationbounds

Mathematics Subject Classification ID

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

Related Items

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem, Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem, Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem, Heuristic methods and applications: A categorized survey

Cites Work

• Unnamed Item
• A Dynamic Programming Approach to Sequencing Problems
• P-Complete Approximation Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Some Examples of Difficult Traveling Salesman Problems
• Tight bounds for christofides' traveling salesman heuristic
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Technical Note—Bounds for the Travelling-Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem