Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299): Difference between revisions

@@ Property / cites work @@
+Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
+Normal rank
@@ Property / cites work @@
+Noising methods for a clique partitioning problem
@@ Property / cites work: Noising methods for a clique partitioning problem / rank @@
+Normal rank
@@ Property / cites work @@
+Design of balanced MBA student teams
@@ Property / cites work: Design of balanced MBA student teams / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: methods and applications
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Q5525682
@@ Property / cites work: Q5525682 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4742505
@@ Property / cites work: Q4742505 / rank @@
+Normal rank
@@ Property / cites work @@
+The clique partitioning problem: Facets and patching facets
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for maximum diverse grouping problem
+Normal rank
@@ Property / cites work @@
+Solving group technology problems via clique partitioning
+Normal rank
@@ Property / cites work @@
+Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis
+Normal rank
@@ Property / cites work @@
+An empirical comparison of heuristic methods for creating maximally diverse groups
+Normal rank