On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326): 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 @@
+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 @@
+On the Matrix-Cut Rank of Polyhedra
@@ Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Valid inequalities for mixed integer linear programs
+Normal rank
@@ Property / cites work @@
+Elementary closures for integer programs.
@@ Property / cites work: Elementary closures for integer programs. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of the Stability Number of a Graph via Copositive Programming
+Normal rank
@@ Property / cites work @@
+When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
+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 @@
+The stable set problem and the lift-and-project ranks of graphs
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+A reformulation-linearization technique for solving discrete and continuous nonconvex problems
+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 @@
+Tighter representations for set partitioning problems
+Normal rank
@@ Property / cites work @@
+On a Representation of the Matching Polytope Via Semidefinite Liftings
+Normal rank