A heuristic algorithm for the set covering problem (Q4645914): Difference between revisions

@@ 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.1007/3-540-61310-2_6
+Normal rank
@@ Property / OpenAlex ID @@
+W1489062326
@@ Property / OpenAlex ID: W1489062326 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+Q4735035
@@ Property / cites work: Q4735035 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian-based heuristic for large-scale set covering problems
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+A surrogate heuristic for set covering problems
@@ Property / cites work: A surrogate heuristic for set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
+Normal rank