Splitting an ordering into a partition to minimize diameter

DOI10.1007/s003579900003zbMath0897.92042OpenAlexW2066951278MaRDI QIDQ1367012

Charles J. Alpert, Andrew B. Kahng

Publication date: 23 September 1998

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003579900003

zbMATH Keywords

seriationsequencingconstrained clusteringrestricted partitionvertex orderingdiameter criterionmaximum cluster diametermetric data setsoptimal bipartitions

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Applications of mathematical programming (90C90) Dynamic programming (90C39) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items (4)

Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem ⋮ A network flow model for biclustering via optimal re-ordering of data matrices ⋮ A sampling-based exact algorithm for the solution of the minimax diameter clustering problem ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

This page was built for publication: Splitting an ordering into a partition to minimize diameter