Central European Journal of Operations Research · 2023 · 15 citations · 17 references
Natural SciencesComputer ScienceMathematicsAlgorithmsDiscrete MathematicsOptimizationCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingLinear ProgrammingMathematical ProgrammingOptimization TheoryClusteringInteger Linear ProgrammingK-means ClusteringLinear ConstraintsMixed-integer Linear ProgrammingMixed-integer OptimizationMixed-integer Programming
Abstract The minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear programming formulation (MILP) is still missing. In this paper, we formulate MILP models. The advantage of MILP formulation is that users can extend the original problem with arbitrary linear constraints. We also present numerical results, we solve these models up to sample size of 150.
17
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
Ronald Aylmer Fisher · Annals of Eugenics · 1936 · 14.7K citations · Full text
NP-hardness of Euclidean sum-of-squares clustering
Daniel Aloise, Amit Deshpande, Pierre Hansen et al. · Machine Learning · 2009 · 863 citations · Full text
Cluster analysis and mathematical programming
Pierre Hansen, Brigitte Jaumard · Mathematical Programming · 1997 · 617 citations