Author:
Kel’manov A. V.,Pyatkin A. V.,Khandeev V. I.
Subject
Mathematics (miscellaneous)
Reference17 articles.
1. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-hardness of Euclidean sum-of-squares clustering,” Mach. Learn. 75 (2), 245–248 (2009).
https://doi.org/10.1007/s10994-009-5103-0
2. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. Part II: The $$p$$-medians,” SIAM J. Appl. Math. 37 (3), 513–538 (1979).
https://doi.org/10.1137/0137041
3. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence,” Sib. Zh. Industr. Mat. 9 (1(25)), 55–74 (2006).
4. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A posteriori detecting a quasiperiodic fragment in a numerical sequence,” Pattern Recogn. Image Anal. 18 (1), 30–42 (2008).
https://doi.org/10.1134/S1054661808010057
5. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, “The problem of finding a subset of vectors with the maximum total weight,” J. Appl. Industr. Math. 2 (1), 32–38 (2008).