✦ LIBER ✦

NP-hardness of Euclidean sum-of-squares clustering

✍ Scribed by Daniel Aloise; Amit Deshpande; Pierre Hansen; Preyas Popat

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Sum of Squares Clustering in a L

✍ Pierre Hansen; Brigitte Jaumard; Nenad Mladenovic 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 857 KB

On the sum of squared distances in the E

✍ F. Pillichshammer 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 87 KB

An improved column generation algorithm

✍ Daniel Aloise; Pierre Hansen; Leo Liberti 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 380 KB

Maximum sum-of-splits clustering

✍ P. Hansen; B. Jaumard; O. Frank 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 1009 KB

Minimum sum of diameters clustering

✍ P. Hansen; B. Jaumard 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 646 KB

Evaluating a branch-and-bound RLT-based

✍ Daniel Aloise; Pierre Hansen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 253 KB