A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
2008
E S A I M: Control, Optimisation and Calculus of Variations
Preserved Fulltext
We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the Euclidean TSP. Mathematics Subject Classification. 90C26, 90C59, 90C27.
doi:10.1051/cocv:2008056
fatcat:fezrx75udzctpaa2jomira6tum