Статьи - Sciact

Статьи (62)

#	Публикация
21	Chernykh I. , Pyatkin A. Irreducible bin packing and normality in routing open shop Annals of Mathematics and Artificial Intelligence. 2021. V.89. N8-9. P.899-918. DOI: 10.1007/s10472-021-09759-x WOS Scopus OpenAlex
22	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Size of the Clusters: Complexity and Approximability Proceedings of the Steklov Institute of Mathematics. 2021. V.313. NS1. P.S117-S124. DOI: 10.1134/s0081543821030123 WOS Scopus OpenAlex
23	Pyatkin A.V. NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes Communications in Computer and Information Science. 2021. P.248-256. DOI: 10.1007/978-3-030-86433-0_17 Scopus OpenAlex
24	Chernykh I. , Pyatkin A. Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop Lecture Notes in Computer Science. 2020. P.106-120. DOI: 10.1007/978-3-030-38629-0_9 Scopus OpenAlex
25	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. On the Complexity of SomeMax–Min Clustering Problems Proceedings of the Steklov Institute of Mathematics. 2020. V.309. NS1. P.S65-S73. DOI: 10.1134/s0081543820040082 WOS Scopus OpenAlex
26	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. NP-Hardness of Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Cluster Sizes Doklady Mathematics. 2020. V.100. N3. P.545-548. DOI: 10.1134/s1064562419060127 WOS Scopus OpenAlex
27	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters Computational Mathematics and Mathematical Physics. 2020. V.60. N1. P.163-170. DOI: 10.1134/s096554251911006x WOS Scopus OpenAlex
28	Eremeev A.V. , Kovalyov M.Y. , Pyatkin A.V. On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances Lecture Notes in Computer Science. 2020. P.40-45. DOI: 10.1007/978-3-030-53552-0_6 Scopus OpenAlex
29	Kel’manov A. , Khandeev V. , Pyatkin A. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters Communications in Computer and Information Science. 2020. P.127-136. DOI: 10.1007/978-3-030-38603-0_10 Scopus OpenAlex
30	Kononov A. , Strekalovsky A. , Posypkin M. , Pyatkin A. Preface Journal of Global Optimization. 2020. V.76. N3. P.453-454. DOI: 10.1007/s10898-020-00887-y WOS Scopus OpenAlex
31	Golovachev M.O. , Pyatkin A.V. On a Routing Open Shop Problem on Two Nodes with Unit Processing Times Journal of Applied and Industrial Mathematics. 2020. V.14. N3. P.470-479. DOI: 10.1134/s1990478920030060 Scopus OpenAlex
32	Pyatkin A.V. Easy NP-hardness Proofs of Some Subset Choice Problems Communications in Computer and Information Science. 2020. P.70-79. DOI: 10.1007/978-3-030-58657-7_8 Scopus OpenAlex
33	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters Doklady Mathematics. 2019. V.99. N1. P.52-56. DOI: 10.1134/s1064562419010162 WOS Scopus OpenAlex
34	Kel’manov A. , Khamidullin S. , Khandeev V. , Pyatkin A. An Exact Algorithm of Searching for the Largest Size Cluster in an Integer Sequence 2-Clustering Problem Communications in Computer and Information Science. 2019. P.131-143. DOI: 10.1007/978-3-030-10934-9_10 Scopus OpenAlex
35	Cheon G-S. , Kim J. , Kim M. , Kitaev S. , Pyatkin A. On $k\textrm{-}11$-representable graphs Journal of Combinatorics. 2019. V.10. N3. P.491-513. DOI: 10.4310/joc.2019.v10.n3.a3 WOS OpenAlex
36	Golovachev M. , Pyatkin A.V. Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines Lecture Notes in Computer Science. 2019. P.264-276. DOI: 10.1007/978-3-030-22629-9_19 Scopus OpenAlex
37	Eremeev A.V. , Kel’manov A.V. , Kovalyov M.Y. , Pyatkin A.V. Maximum Diversity Problem with Squared Euclidean Distance Lecture Notes in Computer Science. 2019. P.541-551. DOI: 10.1007/978-3-030-22629-9_38 Scopus OpenAlex
38	Пяткин А.В. О предписанной (k, l)-раскраске инциденторов мультиграфов четной степени при некоторых значениях k и l Труды Института математики и механики УрО РАН (Trudy Instituta Matematiki i Mekhaniki UrO RAN). 2019. Т.25. №2. С.177-184. DOI: 10.21538/0134-4889-2019-25-2-177-184 WOS Scopus OpenAlex
39	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters Doklady Mathematics. 2019. V.100. N2. P.416-419. DOI: 10.1134/s1064562419050028 WOS Scopus OpenAlex
40	Kel’manov A. , Khandeev V. , Pyatkin A. NP-hardness of Some Max-Min Clustering Problems Communications in Computer and Information Science. 2019. P.144-154. DOI: 10.1007/978-3-030-10934-9_11 Scopus OpenAlex

2 / 4 - Всего 62 записей

Фильтр

Название

Год

DOI

Реферат

Ключевые слова

Жанр

Оригинальность

Журнал

Язык

Автор

Open access

Сортировка

Столбцы

Записей на страницу

Сбросить