Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747): Difference between revisions

@@ Property / cites work @@
+Lift and project relaxations for the matching and related polytopes
+Normal rank
@@ Property / cites work @@
+Disjunctive programming: Properties of the convex hull of feasible points
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Subset Algebra Lift Operators for 0-1 Integer Programming
+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 @@
+On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP
+Normal rank
@@ Property / cites work @@
+Computation of the Lasserre Ranks of Some Polytopes
+Normal rank
@@ Property / cites work @@
+Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy
+Normal rank
@@ Property / cites work @@
+Theta Bodies for Polynomial Ideals
@@ Property / cites work: Theta Bodies for Polynomial Ideals / rank @@
+Normal rank
@@ Property / cites work @@
+When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
+Normal rank
@@ Property / cites work @@
+Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
+Normal rank
@@ Property / cites work @@
+Q4537750
@@ Property / cites work: Q4537750 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
+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 @@
+The stable set problem and the lift-and-project ranks of graphs
+Normal rank
@@ Property / cites work @@
+Sherali-adams relaxations of the matching polytope
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+On a Representation of the Matching Polytope Via Semidefinite Liftings
+Normal rank