Combinatorial optimization and hierarchical classifications

DOI10.1007/s10288-004-0051-9zbMath1056.62075OpenAlexW3162977411MaRDI QIDQ1762886

François Brucker, Christophe Osswald, Jean-Pierre Barthelemy

Publication date: 11 February 2005

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-004-0051-9

zbMATH Keywords

complexityclustering algorithmsdissimilarity modelsquasi-hierarchiesrigid hypergraphssubdominant

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Hypergraphs (05C65) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items (15)

Twelve surveys in operations research ⋮ Ultrametric Watersheds ⋮ On the equivalence between hierarchical segmentations and ultrametric watersheds ⋮ Distributivity of a segmentation lattice ⋮ On Robinsonian dissimilarities, the consecutive ones property and latent variable models ⋮ On encodings of phylogenetic networks of bounded level ⋮ Surveys in operations research ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ Eleven surveys in operations research ⋮ Combinatorial optimisation and hierarchical classifications ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ UPGMA clustering revisited: a weight-driven approach to transitive approximation ⋮ ON MATHEMATICAL MODELLING OF SYNTHETIC MEASURES ⋮ Representation of graphs by means of generalized metrics ⋮ Ultrametricity of Dissimilarity Spaces and Its Significance for Data Mining

This page was built for publication: Combinatorial optimization and hierarchical classifications