Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
From MaRDI portal
Publication:6166100
Recommendations
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Min-cut clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
Cites work
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 2222601 (Why is no real title available?)
- A Branch and Bound Clustering Algorithm
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Mathematical Theory of Communication
- A global optimization RLT-based approach for solving the hard clustering problem
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- An improved column generation algorithm for minimum sum-of-squares clustering
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Branching rules revisited
- Clustering to minimize the maximum intercluster distance
- Constructing a high-dimensional \(k\)NN-graph using a Z-order curve
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Evaluation of a Branch and Bound Algorithm for Clustering
- Formulating logical implications in combinatorial optimisation
- Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
- Geometry of cuts and metrics
- Global optimality in k-means clustering
- Impartial trimmed k-means for functional data
- Improved Conic Reformulations for $K$-means Clustering
- Information-theoretic approaches to branching in search
- Least squares quantization in PCM
- NP-hardness of Euclidean sum-of-squares clustering
- Numerical methods for fuzzy clustering
- On the distribution of points in a cube and the approximate evaluation of integrals
- Orbitopal fixing
- Packing and partitioning orbitopes
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Solution of large-scale symmetric travelling salesman problems
- Solving mixed integer nonlinear programs by outer approximation
- TSPLIB—A Traveling Salesman Problem Library
- The planar \(k\)-means problem is NP-hard
- The quickhull algorithm for convex hulls
- The ratio-cut polytope and K-means clustering
- \(k\)-mean alignment for curve clustering
Cited in
(7)- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Mixed-integer linear programming formulations for the software clustering problem
- Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
- Mixed integer linear programming formulation for K-means clustering problem
- Hybrid matheuristics for the multi-capacitated clustering problem
This page was built for publication: Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166100)
