What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196): Difference between revisions

@@ Property / describes a project that uses @@
+OR-Library
@@ Property / describes a project that uses: OR-Library / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2016.03.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2311739387
@@ Property / OpenAlex ID: W2311739387 / rank @@
+Normal rank
@@ Property / cites work @@
+Surrogate constraint normalization for the set covering problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+An empirical study of hybrid genetic algorithms for the set covering problem
+Normal rank
@@ Property / cites work @@
+A large-scale application of the partial coverage uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+An efficient heuristic for large set covering problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1790196