The greedy algorithm for the symmetric TSP

MaRDI QIDQ5755528zbMATH OpenFDO

Authors G. Gutin, A. Yeo

Publication date 13 August 2007

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/2732

zbMATH Keywords

greedy algorithmheuristicsSymmetric TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The approximation ratio of the greedy algorithm for the metric traveling salesman problem
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• When the greedy algorithm fails
• Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
• scientific article; zbMATH DE number 4019111

Cited in

(1)

• Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

This page was built for publication: The greedy algorithm for the symmetric TSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5755528)