Displaying similar documents to “A BSSS algorithm for the location problem with minimum square error.”

Continuous reformulations and heuristics for the euclidean travelling salesperson problem

Tuomo Valkonen, Tommi Kärkkäinen (2009)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

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.

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 ∈ ℝ n : i = 1 , ⋯ , m } which consists of k disjoint nonempty subsets π 1 , ⋯ , π k , 1 ≤ k ≤ 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...

Timed Petri-net based formulation and an algorithm for the optimal scheduling of batch plants

Tianlong Gu, Parisa Bahri, Guoyong Cai (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis...