1. NP-hardness of some max-min clustering problems

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer, p. 144-154 11 p. (Communications in Computer and Information Science; vol. 974).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  2. NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points

    Kel’manov, A. V. & Pyatkin, A. V., 1 May 2018, In: Computational Mathematics and Mathematical Physics. 58, 5, p. 822-826 5 p.

    Research output: Contribution to journalArticlepeer-review

  3. NP-hardness of quadratic euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Nov 2019, In: Doklady Mathematics. 100, 3, p. 545-548 4 p.

    Research output: Contribution to journalArticlepeer-review

  4. NP-Hardness of balanced minimum sum-of-squares clustering

    Pyatkin, A., Aloise, D. & Mladenović, N., 1 Oct 2017, In: Pattern Recognition Letters. 97, p. 44-45 2 p.

    Research output: Contribution to journalArticlepeer-review

  5. NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes

    Pyatkin, A. V., 2021, Mathematical Optimization Theory and Operations Research: Recent Trends - 20th International Conference, MOTOR 2021, Revised Selected Papers. Strekalovsky, A., Kochetov, Y., Gruzdeva, T. & Orlov, A. (eds.). Springer, p. 248-256 9 p. (Communications in Computer and Information Science; vol. 1476 CCIS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  6. NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., 1 Sept 2019, In: Doklady Mathematics. 100, 2, p. 416-419 4 p.

    Research output: Contribution to journalArticlepeer-review

  7. Maximum diversity problem with squared euclidean distance

    Eremeev, A. V., Kel’manov, A. V., Kovalyov, M. Y. & Pyatkin, A. V., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Khachay, M., Pardalos, P. & Kochetov, Y. (eds.). Springer, p. 541-551 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11548 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  8. Irreducible bin packing and normality in routing open shop

    Chernykh, I. & Pyatkin, A., Sept 2021, In: Annals of Mathematics and Artificial Intelligence. 89, 8-9, p. 899-918 20 p.

    Research output: Contribution to journalArticlepeer-review

  9. Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop

    Chernykh, I. & Pyatkin, A., 22 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Gabler, p. 106-120 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11968 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  10. Exact algorithms for two quadratic euclidean problems of searching for the largest subset and longest subsequence

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer, p. 326-336 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11353 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

ID: 3437278