Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
type: Item
instance of: scholarly article
title: Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
zbMATH Open document ID: 0353.65004
DOI: 10.1016/S0377-2217(77)81005-9
author: Helmuth Späth
published in: European Journal of Operational Research
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 3550049
MaRDI profile type: Publication
cites work: Q4054519
cites work: Q4045898
cites work: Q4765877
cites work: Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
cites work: Q4403756
cites work: Cluster analysis. A survey
cites work: A Criterion and an Algorithm for Grouping Data
cites work: On Steiner’s Problem with Rectilinear Distance
cites work: A Dynamic Programming Algorithm for Cluster Analysis
cites work: A Branch and Bound Clustering Algorithm
cites work: Exact and approximate solutions to the multisource weber problem
cites work: A note on Fermat's problem
cites work: Q5617409
cites work: Cluster Analysis and Mathematical Programming
cites work: Q4092850
cites work: Q4066394
cites work: \(L_1\) cluster analysis
cites work: Heuristische Lösungsverfahren Versuch einer Begriffsklärung
cites work: Integer Programming and the Theory of Grouping
cites work: Q5767400
cites work: Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
full work available at URL: s0377-2217(77)81005-9
OpenAlex ID: W142275858
description: scientific article; zbMATH DE number 3550049