Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem

Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem Full article

Journal

Communications in Computer and Information Science
ISSN: 1865-0929

Output data

Year: 2020, Pages: 30-35 Pages count : 6 DOI: 10.1007/978-3-030-58657-7_4

Authors

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

Affiliations

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