SOS-SDP : an exact solver for minimum sum-of-squares clustering
Year of publication: |
2022
|
---|---|
Authors: | Piccialli, Veronica ; Sudoso, Antonio M. ; Wiegele, Angelika |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 4, p. 2144-2162
|
Subject: | branch and bound | clustering | semidefinite programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Regionales Cluster | Regional cluster | Clusteranalyse | Cluster analysis | Branch-and-Bound | Branch and Bound |
-
An improved branch-and-bound clustering approach for data partitioning
Cheng, Chun Hung, (2011)
-
A cluster first-route second approach for a capacitated vehicle routing problem : a case study
Comert, Serap Ercan, (2018)
-
Exact algorithms for solving a bi-level location-allocation problem considering customer preferences
Mirzaei, Ehsan, (2019)
- More ...
-
An exact algorithm for semi-supervised minimum sum-of-squares clustering
Piccialli, Veronica, (2022)
-
Binarized Support Vector Machines
Buchheim, Christoph, (2010)
-
Partitioning through projections : strong SDP bounds for large graph partition problems
Meijer, Frank de, (2023)
- More ...