Mixed-integer programming techniques for the minimum sum-of-squares clustering problem

DOI10.1007/S10898-022-01267-4zbMATH Open1522.90036MaRDI QIDQ6166100FDOQ6166100

Authors: Jan Pablo Burgard, Carina Moreira Costa, Christopher Hojny, Thomas Kleinert, Martin Schmidt

Publication date: 2 August 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

global optimization computational techniques mixed-integer nonlinear optimization minimum sum-of-squares clustering

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Mixed integer programming (90C11)

Cites Work

TSPLIB—A Traveling Salesman Problem Library
$k$-mean alignment for curve clustering
Least squares quantization in PCM
A Mathematical Theory of Communication
NP-hardness of Euclidean sum-of-squares clustering
Title not available (Why is that?)
On the distribution of points in a cube and the approximate evaluation of integrals
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
The quickhull algorithm for convex hulls
Solving mixed integer nonlinear programs by outer approximation
Branching rules revisited
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Title not available (Why is that?)
Geometry of cuts and metrics
Clustering to minimize the maximum intercluster distance
Title not available (Why is that?)
Formulating logical implications in combinatorial optimisation
The planar $k$-means problem is NP-hard
Packing and partitioning orbitopes
A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
Numerical methods for fuzzy clustering
An improved column generation algorithm for minimum sum-of-squares clustering
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
Orbitopal fixing
Solution of large-scale symmetric travelling salesman problems
A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
A global optimization RLT-based approach for solving the hard clustering problem
Impartial trimmed $k$-means for functional data
Information-theoretic approaches to branching in search
Fuzzy Sets and Decisionmaking Approaches in Vowel and Speaker Recognition
Approximating K‐means‐type Clustering via Semidefinite Programming
A Branch and Bound Clustering Algorithm
Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
Evaluation of a Branch and Bound Algorithm for Clustering
Title not available (Why is that?)
Global optimality in $k$-means clustering
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
Improved Conic Reformulations for $K$-means Clustering
Constructing a High-Dimensional k NN-Graph Using a Z-Order Curve
The Ratio-Cut Polytope and K-Means Clustering

Cited In (4)

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
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)