Evaluation of a Branch and Bound Algorithm for Clustering
From MaRDI portal
Recommendations
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
- A parallel branch-and-bound method for cluster analysis
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- scientific article; zbMATH DE number 6007853
- An approximation algorithm for a problem of cluster analysis
- Exact and approximation algorithms for clustering
- An application of limited branching in clustering
- scientific article; zbMATH DE number 1836285
Cited in
(41)- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
- Cluster analysis and mathematical programming
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- New diagonal bundle method for clustering problems in large data sets
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- A parallel branch-and-bound method for cluster analysis
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- K-means clustering via a nonconvex optimization approach
- Taxicab correspondence analysis
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- An incremental clustering algorithm based on hyperbolic smoothing
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- A scatter search approach for the minimum sum-of-squares clustering problem
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The capacitated centred clustering problem
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- An improved branch-and-bound clustering approach for data partitioning
- scientific article; zbMATH DE number 3887426 (Why is no real title available?)
- scientific article; zbMATH DE number 4164560 (Why is no real title available?)
- An application of limited branching in clustering
- scientific article; zbMATH DE number 3942814 (Why is no real title available?)
- Evaluation of the branch and bound algorithm for feature selection
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
- Recent developments in approximation algorithms for facility location and clustering problems
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- An algorithm for minimizing clustering functions
- scientific article; zbMATH DE number 2231543 (Why is no real title available?)
- scientific article; zbMATH DE number 4189544 (Why is no real title available?)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- Algorithms for the boundary selection problem
- Strong bounds for large-scale minimum sum-of-squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Design of hybrids for the minimum sum-of-squares clustering problem
This page was built for publication: Evaluation of a Branch and Bound Algorithm for Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5186698)
