Primal-Dual Schema for Capacitated Covering Problems (Q3503854): Difference between revisions

@@ Property / cites work @@
+Capacitated Facility Location: Valid Inequalities and Facets
+Normal rank
@@ Property / cites work @@
+When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems
+Normal rank
@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Problems with Hard Capacities
@@ Property / cites work: Covering Problems with Hard Capacities / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for vertex cover with hard capacities
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
+Normal rank
@@ Property / cites work @@
+Primal-Dual Algorithms for Deterministic Inventory Problems
+Normal rank
@@ Property / cites work @@
+Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
+Normal rank