Experiments with a very efficient heuristic for clustering problems

DOI10.1016/0306-4379(79)90022-XzbMath0435.62062OpenAlexW2075369240MaRDI QIDQ1140385

Larry E. Stanfel

Publication date: 1979

Published in: Information Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0306-4379(79)90022-x

zbMATH Keywords

sequential algorithmdistance matrixnonlinear clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Information storage and retrieval of data (68P20)

Related Items (2)

A Lagrangian treatment of certain nonlinear clustering problems ⋮ Some inequalities for the first general Zagreb index of graphs and line graphs

This page was built for publication: Experiments with a very efficient heuristic for clustering problems