scientific article; zbMATH DE number 3672307

MaRDI QIDQ3869362zbMATH OpenFDO

Authors Pierre Hansen, Michel Delattre

Publication date 1979

zbMATH Keywords

cluster analysisclusterscomplete-linkgraph coloringhomogeneous subsetsmaximum dissimilarity

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Coloring of graphs and hypergraphs (05C15)

Cited in

(31)

• A graph b-coloring framework for data clustering
• The weighted sum of split and diameter clustering
• Clusteranalyse - Überblick und neuere Entwicklungen
• Chromatic optimisation: Limitations, objectives, uses, references
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• COSINE: A new graph coloring algorithm
• Chromatic scheduling and frequency assignment
• Cluster analysis and mathematical programming
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
• Stepwise decomposition approaches for large scale cell formation problems
• The robust coloring problem.
• Ising formulations of some graph-theoretic problems in psychological research: models and methods
• A partitional clustering algorithm validated by a clustering tendency index based on graph theory
• On the sum-max graph partitioning problem
• ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses
• Visual attractiveness in vehicle routing via bi-objective optimization
• Constrained clustering by constraint programming
• Some experiments with simulated annealing for coloring graphs
• Minimum sum of diameters clustering
• Maximum sum-of-splits clustering
• Genetic clustering algorithms.
• An exact algorithm for the two-mode \(KL\)-means partitioning problem
• A review of multiobjective programming and its application in quantitative psychology
• A review on declarative approaches for constrained clustering
• Designing algorithms for machine learning and data mining
• Constrained clustering: current and new trends
• Integer programming in psychology: a review and directions for future research
• Enumeration of the partitions with minimum diameter
• A bisection method for solving distance-based clustering problems globally
• A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
• Set partition by globally optimized cluster seed points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869362)