Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9032-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2072770591
@@ Property / OpenAlex ID: W2072770591 / rank @@
+Normal rank
@@ Property / cites work @@
+When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
+Normal rank
@@ Property / cites work @@
+Q4532026
@@ Property / cites work: Q4532026 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Greedy Strikes Back: Improved Facility Location Algorithms
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for a capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Metric Facility Location Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Problems Combining Facility Location and Network Design
+Normal rank
@@ Property / cites work @@
+Q4952699
@@ Property / cites work: Q4952699 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for connected facility location problems
+Normal rank
@@ Property / cites work @@
+Q3044310
@@ Property / cites work: Q3044310 / rank @@
+Normal rank