Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154): Difference between revisions

@@ Property / cites work @@
+Solving huge size instances of the optimal diversity management problem
+Normal rank
@@ Property / cites work @@
+The linking set problem: a polynomial special case of the multiple-choice knapsack problem
+Normal rank
@@ Property / cites work @@
+A decomposition approach for a very large scale optimal diversity management problem
+Normal rank
@@ Property / cites work @@
+Computational study of large-scale \(p\)-median problems
+Normal rank
@@ Property / cites work @@
+The Optimal Diversity Management Problem
@@ Property / cites work: The Optimal Diversity Management Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fast primal and dual heuristics for the \(p\)-median location problem
+Normal rank
@@ Property / cites work @@
+The minimum weight \(t\)-composition of an integer
+Normal rank
@@ Property / cites work @@
+Q3993417
@@ Property / cites work: Q3993417 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution methods for thep-median problem: An annotated bibliography
+Normal rank