Artem Pyatkin, Daniel Aloise and Nenad Mladenović
Article (2017)
An external link is available for this itemDepartment: | Department of Computer Engineering and Software Engineering |
---|---|
PolyPublie URL: | https://publications.polymtl.ca/37972/ |
Journal Title: | Pattern Recognition Letters (vol. 97) |
Publisher: | Elsevier |
DOI: | 10.1016/j.patrec.2017.05.033 |
Official URL: | https://doi.org/10.1016/j.patrec.2017.05.033 |
Date Deposited: | 18 Apr 2023 15:04 |
Last Modified: | 25 Sep 2024 16:22 |
Cite in APA 7: | Pyatkin, A., Aloise, D., & Mladenović, N. (2017). NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognition Letters, 97, 44-45. https://doi.org/10.1016/j.patrec.2017.05.033 |
---|---|
Statistics
Dimensions