On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters › Research Explorer

Novosibirsk State University's Research Portal

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

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

DOI

https://doi.org/10.1007/978-3-030-38603-0_10
Final published version

Alexander Kel’manov
Vladimir Khandeev
Artem Pyatkin

Original language	English
Title of host publication	Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers
Editors	Milojica Jaćimović, Michael Khachay, Vlasta Malkova, Mikhail Posypkin
Publisher	Springer Gabler
Pages	127-136
Number of pages	10
ISBN (Print)	9783030386023
DOIs	https://doi.org/10.1007/978-3-030-38603-0_10
Publication status	Published - 1 Jan 2020
Event	10th International Conference on Optimization and Applications, OPTIMA 2019 - Petrovac, Montenegro Duration: 30 Sept 2019 → 4 Oct 2019

Publication series

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

Conference

Conference	10th International Conference on Optimization and Applications, OPTIMA 2019
Country/Territory	Montenegro
City	Petrovac
Period	30.09.2019 → 04.10.2019

Research areas

Balanced partition, Euclidean space, Normalized by the cluster size, NP-completeness, Quadratic variance, Sized-weighted

ID: 23265235