Clustering heuristics for set covering (Q1309879): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4054519
@@ Property / cites work: Q4054519 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Set-Covering Problem: II. An Algorithm for Set Partitioning
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+Q3037131
@@ Property / cites work: Q3037131 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Bicriterion Cluster Analysis
@@ Property / cites work: Bicriterion Cluster Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic heuristic for a computationally difficult set covering problem
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
+Normal rank
@@ Property / cites work @@
+Q4148820
@@ Property / cites work: Q4148820 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3760270
@@ Property / cites work: Q3760270 / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster Analysis: An Application of Lagrangian Relaxation
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3824115
@@ Property / cites work: Q3824115 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1309879