Article contents
Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
Published online by Cambridge University Press: 20 August 2008
Abstract
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.
- Type
- Research Article
- Information
- ESAIM: Control, Optimisation and Calculus of Variations , Volume 15 , Issue 4 , October 2009 , pp. 895 - 913
- Copyright
- © EDP Sciences, SMAI, 2008
References
- 3
- Cited by