6533b833fe1ef96bd129ca6a
RESEARCH PRODUCT
Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
Tuomo ValkonenTommi Kärkkäinensubject
Computational MathematicsMathematical optimizationControl and OptimizationControl and Systems EngineeringProblem FormulationsEuclidean geometryApplied mathematicsComputer Science::Data Structures and AlgorithmsHeuristicsCluster analysisMathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2008-08-20 | ESAIM: Control, Optimisation and Calculus of Variations |