a1 Department of Mathematical Information Technology, University of Jyväskylä, Jyväskylä, Finland. email@example.com; firstname.lastname@example.org
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.
(Received March 17 2008)
(Online publication August 20 2008)
Mathematics Subject Classification: