Continuous reformulations and heuristics for the euclidean travelling salesperson problem

Tuomo Valkonen; Tommi Kärkkäinen

Displaying similar documents to “Continuous reformulations and heuristics for the euclidean travelling salesperson problem”

A BSSS algorithm for the location problem with minimum square error.

Fathali, Jafar, Zaferanieh, Mehdi, Nezakati, Ahmad (2009)

Advances in Operations Research

Similarity:

Interpretation and optimization of the $k$ -means algorithm

Kristian Sabo, Rudolf Scitovski (2014)

Applications of Mathematics

Similarity:

The paper gives a new interpretation and a possible optimization of the well-known $k$ -means algorithm for searching for a locally optimal partition of the set $𝒜 = {a_{i} \in ℝ^{n} : i = 1, \dots, m}$ which consists of $k$ disjoint nonempty subsets $π_{1}, \dots, π_{k}$ , $1 \leq k \leq m$ . For this purpose, a new divided $k$ -means algorithm was constructed as a limit case of the known smoothed $k$ -means algorithm. It is shown that the algorithm constructed in this way coincides with the $k$ -means algorithm if during the iterative procedure no data points appear in the...