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

Novosibirsk State University's Research Portal

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

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

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/978-3-030-58657-7_4
Final published version

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Revised Selected Papers
Editors	Yury Kochetov, Igor Bykadorov, Tatiana Gruzdeva
Publisher	Springer
Pages	30-35
Number of pages	6
ISBN (Print)	9783030586560
DOIs	https://doi.org/10.1007/978-3-030-58657-7_4
Publication status	Published - Jul 2020
Event	19th International Conference on Mathematical Optimization Theory and Operations Research - Novosibirsk, Russian Federation Duration: 6 Jul 2020 → 10 Jul 2020 Conference number: 19

Publication series

Name	Communications in Computer and Information Science
Volume	1275 CCIS
ISSN (Print)	1865-0929
ISSN (Electronic)	1865-0937

Conference

Conference	19th International Conference on Mathematical Optimization Theory and Operations Research
Abbreviated title	MOTOR 2020
Country/Territory	Russian Federation
City	Novosibirsk
Period	06.07.2020 → 10.07.2020

Research areas

Euclidean space, Exact algorithm, Minimum sum-of-squares, NP-hard problem, One-dimensional case, Polynomial-time, Weighted clustering

ID: 25674900