Computational experience with general cutting planes for the set covering problem (Q1002077): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2008.09.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2006346540
@@ Property / OpenAlex ID: W2006346540 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Exact solutions to linear programming problems
@@ Property / cites work: Exact solutions to linear programming problems / rank @@
+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 Heuristic Method for the Set Covering Problem
@@ Property / cites work: A Heuristic Method for the Set Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the set covering problem
@@ Property / cites work: Algorithms for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian-based heuristic for large-scale set covering problems
+Normal rank
@@ Property / cites work @@
+On the 0,1 facets of the set covering polytope
@@ Property / cites work: On the 0,1 facets of the set covering polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing over the first Chvátal closure
@@ Property / cites work: Optimizing over the first Chvátal closure / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
+Normal rank
@@ Property / cites work @@
+Solving hard set covering problems
@@ Property / cites work: Solving hard set covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Facets and lifting procedures for the set covering polytope
+Normal rank
@@ Property / cites work @@
+On the facial structure of the set covering polytope
+Normal rank