The greedy algorithm for the symmetric traveling salesman problem

The greedy algorithm for the symmetric traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20073129
Country: Canada
Volume: 2
Issue: 1
Publication Date: Jan 2007
Journal: Algorithmic Operations Research
Authors: ,
Keywords: computational analysis, heuristics
Abstract:

We corrected proofs of two results on the greedy algorithm for the Symmetric TSP and answered a question in Gutin and Yeo, Oper. Res. Lett. 30 (2002), 97–99.

Reviews

Required fields are marked *. Your email address will not be published.