A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169): Difference between revisions

@@ Property / cites work @@
+Lagrangian solution of maximum dispersion problems
+Normal rank
@@ Property / cites work @@
+Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Q4857376
@@ Property / cites work: Q4857376 / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic approach for the max-min diversity problem based on max-clique
+Normal rank
@@ Property / cites work @@
+A New Formulation and Resolution Method for the p-Center Problem
+Normal rank
@@ Property / cites work @@
+The discrete p-dispersion problem
@@ Property / cites work: The discrete p-dispersion problem / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical models for locating undesirable facilities
+Normal rank
@@ Property / cites work @@
+Integer-friendly formulations for the \(r\)-separation problem
+Normal rank
@@ Property / cites work @@
+Easy and hard bottleneck location problems
@@ Property / cites work: Easy and hard bottleneck location problems / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds and exact algorithms for \(p\)-dispersion problems
+Normal rank
@@ Property / cites work @@
+A simple and effective algorithm for the MaxMin diversity problem
+Normal rank
@@ Property / cites work @@
+Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
+Normal rank