Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem | Sciact - Система учета научной деятельности ИМ СО РАН

Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem Научная публикация

Журнал

Communications in Computer and Information Science
ISSN: 1865-0929

Вых. Данные

Год: 2020, Страницы: 30-35 Страниц : 6 DOI: 10.1007/978-3-030-58657-7_4

Авторы

Khandeev Vladimir ^1,2 , Panasenko Anna ^1,2

Организации

1	Sobolev Institute of Mathematics, 4 Koptyug Avenue, 630090 Novosibirsk, Russia
2	Novosibirsk State University, 2 Pirogova Street, 630090 Novosibirsk, Russia

Khandeev V. , Panasenko A.
Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem
Communications in Computer and Information Science. 2020. P.30-35. DOI: 10.1007/978-3-030-58657-7_4 Scopus OpenAlex

Scopus:	2-s2.0-85092074622
OpenAlex:	W3085561310

БД	Цитирований
OpenAlex	1