Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
From MaRDI portal
(Redirected from Publication:628745)
Recommendations
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- Minimum sum of squares clustering in a low dimensional space
Cites work
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A global optimization RLT-based approach for solving the hard clustering problem
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- An efficient algorithm for determining the convex hull of a finite planar set
- An improved column generation algorithm for minimum sum-of-squares clustering
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering
- Cluster Analysis and Mathematical Programming
- Cluster analysis and mathematical programming
- Finding Groups in Data
- Formulating logical implications in combinatorial optimisation
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1302175 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Integer Programming and the Theory of Grouping
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Mathematical classification and clustering
- Minimum sum of squares clustering in a low dimensional space
- NP-hardness of Euclidean sum-of-squares clustering
Cited in
(17)- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- The complexity status of problems related to sparsest cuts
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Column generation bounds for numerical microaggregation
- Branch-and-cut approaches for p-cluster editing
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering
- A generic approach to proving NP-hardness of partition type problems
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- The moment-SOS hierarchy: applications and related topics
- An improved column generation algorithm for minimum sum-of-squares clustering
- A cutting plane algorithm for globally solving low-dimensional k-means problems
- Strong bounds for large-scale minimum sum-of-squares clustering
- New heuristic for harmonic means clustering
This page was built for publication: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628745)
