Optimizing budget allocation for center and median points (Q265070): Difference between revisions

@@ Property / cites work @@
+Upgrading arcs to minimize the maximum travel time in a network
+Normal rank
@@ Property / cites work @@
+Unexplored Steiner Ratios in Geometric Networks
@@ Property / cites work: Unexplored Steiner Ratios in Geometric Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Upgrading trees under diameter and budget constraints
+Normal rank
@@ Property / cites work @@
+Augmenting trees to meet biconnectivity and diameter constraints
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+General network design: a unified view of combined location and network design problems
+Normal rank
@@ Property / cites work @@
+Q4857376
@@ Property / cites work: Q4857376 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for certain network improvement problems
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+Best Upgrade Plans for Large Road Networks
@@ Property / cites work: Best Upgrade Plans for Large Road Networks / rank @@
+Normal rank
@@ Property / cites work @@
+The Weighted Euclidean 1-Center Problem
@@ Property / cites work: The Weighted Euclidean 1-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated facility location/network design problems.
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Location Theory
@@ Property / cites work: Location Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Network upgrading problems
@@ Property / cites work: Network upgrading problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
+Normal rank
@@ Property / cites work @@
+A network improvement problem under different norms
+Normal rank