On the Complexity of Minimum Sum-of-Squares Clustering

Daniel Aloise and Pierre Hansen

Technical Report (2007)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/63760/
Report number:	G-2007-50
Official URL:	https://www.gerad.ca/fr/papers/G-2007-50
Date Deposited:	15 May 2025 15:47
Last Modified:	15 May 2025 15:47

Cite in APA 7:	Aloise, D., & Hansen, P. (2007). On the Complexity of Minimum Sum-of-Squares Clustering. (Technical Report n° G-2007-50). https://www.gerad.ca/fr/papers/G-2007-50
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only