For clustering problems based on the model of mixture probability distribu-L. Kazakovtsev, et al. / Algorithms with Greedy Heuristic Procedures results, higher values of the log likelihood objective function, in comparison with the EM algorithm and its modifications.

No abstract

This paper describes four mathematical models for the single-facility location problems based on four special distance metrics and algorithms for solving such problems. In this study, algorithms of solving Weber problems using four distance predicting functions (DPFs) are proposed in accordance with four strategies for manipulator control. A numerical example is presented in this proposal as an analytical proof of the optimality of their results.

No abstract