A note on heuristics for the traveling salesman problem

DOI10.1007/BF01581633zbMath0437.90062OpenAlexW2000416086MaRDI QIDQ3879044

Gianfranco D'Atri

Publication date: 1980

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

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

zbMATH Keywords

approximationheuristic algorithmscomparison of algorithmsworst case analysisalgorithmic performanceeuclidean traveling salesman problemratio bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Heuristic methods and applications: A categorized survey

Cites Work

• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Tight bounds for christofides' traveling salesman heuristic

This page was built for publication: A note on heuristics for the traveling salesman problem