| Issue |
ESAIM: COCV
Volume 15, Number 4, October-December 2009
|
|
|---|---|---|
| Page(s) | 895 - 913 | |
| DOI | https://doi.org/10.1051/cocv:2008056 | |
| Published online | 20 August 2008 | |
Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
Department of Mathematical Information Technology,
University of Jyväskylä, Jyväskylä, Finland.
tujumava@jyu.fi; tka@mit.jyu.fi
Received:
17
March
2008
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
Key words: Euclidean TSP / clustering / diff-convex / Weiszfeld algorithm
© EDP Sciences, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.