scientific article
From MaRDI portal
Publication:3869362
zbMath0432.05004MaRDI QIDQ3869362
Pierre Hansen, Michel Delattre
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Enumerative combinatorics (05A99)
Related Items
Chromatic scheduling and frequency assignment, A partitional clustering algorithm validated by a clustering tendency index based on graph theory, Cluster analysis and mathematical programming, The weighted sum of split and diameter clustering, Visual attractiveness in vehicle routing via bi-objective optimization, Clusteranalyse - Überblick und neuere Entwicklungen, Chromatic optimisation: Limitations, objectives, uses, references, A review of multiobjective programming and its application in quantitative psychology, On the sum-max graph partitioning problem, Efficient algorithms for divisive hierarchical clustering with the diameter criterion, COSINE: A new graph coloring algorithm, Constrained clustering by constraint programming, Ising formulations of some graph-theoretic problems in psychological research: models and methods, Enumeration of the partitions with minimum diameter, ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses, Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices, Genetic clustering algorithms., Some experiments with simulated annealing for coloring graphs, Minimum sum of diameters clustering, A sampling-based exact algorithm for the solution of the minimax diameter clustering problem, Maximum sum-of-splits clustering, An exact algorithm for the two-mode \(KL\)-means partitioning problem, Stepwise decomposition approaches for large scale cell formation problems, The robust coloring problem., A graph b-coloring framework for data clustering, Set partition by globally optimized cluster seed points
