Solving the capacitated clustering problem with variable neighborhood search (Q1730629): Difference between revisions

@@ Property / cites work @@
+Attraction probabilities in variable neighborhood search
+Normal rank
@@ Property / cites work @@
+Solving the clique partitioning problem as a maximally diverse grouping problem
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Descent for the Capacitated Clustering Problem
+Normal rank
@@ Property / cites work @@
+A reactive GRASP with path relinking for capacitated clustering
+Normal rank
@@ Property / cites work @@
+Tabu search and GRASP for the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+Tabu search and GRASP for the capacitated clustering problem
+Normal rank
@@ Property / cites work @@
+An artificial bee colony algorithm for the maximally diverse grouping problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for maximum diverse grouping problem
+Normal rank