Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria

DOI10.1016/S0377-2217(77)81005-9zbMath0353.65004OpenAlexW142275858MaRDI QIDQ1236403

Helmuth Späth

Publication date: 1977

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(77)81005-9

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Pattern recognition, speech recognition (68T10)

Related Items

Multidimensional data clustering utilizing hybrid search strategies, Pattern classification problems and fuzzy sets, Clusteranalyse - Überblick und neuere Entwicklungen, An algorithm for the minimax Weber problem, Clusterwise linear regression, Minimization subproblems and heuristics for an applied clustering problem

Cites Work

• Cluster analysis. A survey
• \(L_1\) cluster analysis
• Location-Allocation Problems
• A Branch and Bound Clustering Algorithm
• Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
• Heuristische Lösungsverfahren Versuch einer Begriffsklärung
• Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
• Heuristic Methods for Location-Allocation Problems
• Integer Programming and the Theory of Grouping
• On Steiner’s Problem with Rectilinear Distance
• A Dynamic Programming Algorithm for Cluster Analysis
• A Criterion and an Algorithm for Grouping Data
• Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
• Cluster Analysis and Mathematical Programming
• Exact and approximate solutions to the multisource weber problem
• A note on Fermat's problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item