J-MEANS: A new local search heuristic for minimum sum of squares clustering
type: Item
instance of: scholarly article
title: J-MEANS: A new local search heuristic for minimum sum of squares clustering
zbMATH Open document ID: 1012.68873
DOI: 10.1016/S0031-3203(99)00216-2
author: Pierre Hansen
author: Nenad Mladenović
published in: Pattern Recognition
publication date: 2003-06-03T00:00:00Z
Mathematics Subject Classification ID: 68U99
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1717750
zbMATH Keywords: local search heuristic
zbMATH Keywords: J-means
describes a project that uses: TSPLIB
MaRDI profile type: Publication
cites work: Q4181272
cites work: Another interpretation of the EM algorithm for mixture distributions
cites work: A classification EM algorithm for clustering and two stochastic versions
cites work: A Branch and Bound Clustering Algorithm
cites work: Evaluation of a Branch and Bound Algorithm for Clustering
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Q5617409
cites work: Experiments in projection and clustering by simulated annealing
cites work: A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
cites work: Variable neighborhood search
cites work: Q3875132
cites work: Location-Allocation Problems
cites work: Degeneracy in the multi-source Weber problem
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
cites work: Variable neighborhood search for the p-median
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A new adaptive multi-start technique for combinatorial global optimizations
Wikidata QID: Q127740626
full work available at URL: s0031-3203(99)00216-2
OpenAlex ID: W2091292848
description: scientific article; zbMATH DE number 1717750