A cutting plane algorithm for globally solving low-dimensional k-means problems
From MaRDI portal
Cites work
- A local search approximation algorithm for \(k\)-means clustering
- Adaptive Sampling for k-Means Clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- General Symmetry Breaking Constraints
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 3078983 (Why is no real title available?)
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- Improved and simplified inapproximability for \(k\)-means
- Least squares quantization in PCM
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Numerical methods for fuzzy clustering
- On approximate geometric \(k\)-clustering
- Polytopes associated with symmetry handling
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Solution of large-scale symmetric travelling salesman problems
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
This page was built for publication: A cutting plane algorithm for globally solving low-dimensional k-means problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289027)
