A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of-Squares Clustering

Technical Report (2008)

An external link is available for this item

Department:	Department of Computer Engineering and Software Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/63787/
Report number:	G-2008-40
Official URL:	https://www.gerad.ca/fr/papers/G-2008-40
Date Deposited:	12 May 2025 16:46
Last Modified:	12 May 2025 16:46

Cite in APA 7:	Aloise, D., & Hansen, P. (2008). A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of-Squares Clustering. (Technical Report n° G-2008-40). https://www.gerad.ca/fr/papers/G-2008-40

Stats are not available on this system.

View Item