On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11750-013-0275-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2114002675
@@ Property / OpenAlex ID: W2114002675 / rank @@
+Normal rank
@@ Property / cites work @@
+A new alternating heuristic for the (r | p)–centroid problem on the plane
+Normal rank
@@ Property / cites work @@
+An alternating heuristic for medianoid and centroid problems in the plane
+Normal rank
@@ Property / cites work @@
+Q3971522
@@ Property / cites work: Q3971522 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential competitive location on networks
@@ Property / cites work: Sequential competitive location on networks / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+Multiple voting location and single voting location on trees
+Normal rank
@@ Property / cites work @@
+Multiple voting location problems
@@ Property / cites work: Multiple voting location problems / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
+Normal rank