An approximation algorithm for the TSP

DOI10.1016/0020-0190(89)90072-0zbMath0671.90084OpenAlexW1963530117MaRDI QIDQ1119485

J. M. Basart, Llorenç Huguet

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90072-0

zbMATH Keywords

heuristic algorithmtravelling salesmancomplete weighted graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (2)

Improved solutions for the traveling purchaser problem. ⋮ Heuristics for the traveling purchaser problem

Cites Work

• A note on two problems in connexion with graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for the TSP