On clustering problems with connected optima in Euclidean spaces

DOI10.1016/0012-365X(89)90080-0zbMath0665.62062WikidataQ59561116 ScholiaQ59561116MaRDI QIDQ1116236

Peter L. Hammer, Endre Boros

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

optimal partitionconvex hullcluster analysisdissimilaritiesfinite subset of a Euclidean space

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items

Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, Optimal separable partitioning in the plane, Cluster analysis and mathematical programming, Localizing combinatorial properties of partitions, A new approach to solve open-partition problems, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Sphere-separable partitions of multi-parameter elements, Strongly 2-shape-sortability of vector partitions, Direct product decompositions of lattices, closures and relation schemes, Enumerating nested and consecutive partitions, Convex integer maximization via Graver bases, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, ON RECTANGULAR COVERING PROBLEMS, A randomized approximation scheme for metric MAX-CUT