The discrete p-dispersion problem (Q915643): Difference between revisions

@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems
+Normal rank
@@ Property / cites work @@
+An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree
+Normal rank
@@ Property / cites work @@
+Polynomially bounded algorithms for locatingp-centers on a tree
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical models for locating undesirable facilities
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-greedy heuristics: An empirical study
@@ Property / cites work: Semi-greedy heuristics: An empirical study / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+The <i>m</i>-Center Problem
@@ Property / cites work: The <i>m</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between packing and covering numbers of a tree
+Normal rank
@@ Property / cites work @@
+An Analysis of Network Location Problems with Distance Constraints
+Normal rank
@@ Property / cites work @@
+State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
+Normal rank
@@ Property / cites work @@
+Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network
+Normal rank