Approximate fixed-rank closures of covering problems (Q2583148): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-005-0598-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2007741317
@@ Property / OpenAlex ID: W2007741317 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
+Normal rank
@@ Property / cites work @@
+Tree-width and the Sherali-Adams operator
@@ Property / cites work: Tree-width and the Sherali-Adams operator / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Algebra Lift Operators for 0-1 Integer Programming
+Normal rank
@@ Property / cites work @@
+Approximate fixed-rank closures of covering problems
+Normal rank
@@ Property / cites work @@
+On the separation of split cuts and related inequalities
+Normal rank
@@ Property / cites work @@
+On the Matrix-Cut Rank of Polyhedra
@@ Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+A connection between cutting plane theory and the geometry of numbers
+Normal rank
@@ Property / cites work @@
+On the membership problem for the elementary closure of a polyhedron
+Normal rank
@@ Property / cites work @@
+When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
+Normal rank
@@ Property / cites work @@
+Q4537750
@@ Property / cites work: Q4537750 / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+On disjunctive cuts for combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank