11 - 20 out of 43Page size: 10
  1. 2020

  2. Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Mar 2020, In: Annals of Mathematics and Artificial Intelligence. 88, 1-3, p. 157-168 12 p.

    Research output: Contribution to journal › Article › peer-review

  3. Preface

    Kononov, A., Strekalovsky, A., Posypkin, M. & Pyatkin, A., 1 Mar 2020, In: Journal of Global Optimization. 76, 3, p. 453-454 2 p.

    Research output: Contribution to journal › Article › peer-review

  4. 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 proceeding › Conference contribution › Research › peer-review

  5. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer Gabler, p. 127-136 10 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  6. Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Jan 2020, In: Computational Mathematics and Mathematical Physics. 60, 1, p. 163-170 8 p.

    Research output: Contribution to journal › Article › peer-review

  7. 2019

  8. The maximum number of induced open triangles in graphs of a given order

    Pyatkin, A., Lykhovyd, E. & Butenko, S., 1 Nov 2019, In: Optimization Letters. 13, 8, p. 1927-1935 9 p.

    Research output: Contribution to journal › Article › peer-review

  9. 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 journal › Article › peer-review

  10. 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 journal › Article › peer-review

  11. On a list (k, l)-coloring of incidentors in multigraphs of even degree for some values of k and l

    Pyatkin, A. V. E., 20 May 2019, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 25, 2, p. 177-184 8 p.

    Research output: Contribution to journal › Article › peer-review

  12. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times

    van Bevern, R. A., Pyatkin, A. V. & Sevastyanov, S., 1 Jan 2019, In: Сибирские электронные математические известия. 16, p. 42-84 43 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 3 4 5 Next

ID: 3437278