Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433): Difference between revisions

@@ Property / cites work @@
+Quantum mechanical algorithms for the nonabelian hidden subgroup problem
+Normal rank
@@ Property / cites work @@
+The multicovering problem
@@ Property / cites work: The multicovering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computational experience with general cutting planes for the set covering problem
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
+Normal rank
@@ Property / cites work @@
+A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
+Normal rank
@@ Property / cites work @@
+Greedy randomized adaptive search procedures
@@ Property / cites work: Greedy randomized adaptive search procedures / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+An algorithm for set covering problem
@@ Property / cites work: An algorithm for set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4735035
@@ Property / cites work: Q4735035 / rank @@
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank