Tree-width and the Sherali-Adams operator (Q2386210): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2004.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2080394239
@@ Property / OpenAlex ID: W2080394239 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Algebra Lift Operators for 0-1 Integer Programming
+Normal rank
@@ Property / cites work @@
+Wheel inequalities for stable set polytopes
@@ Property / cites work: Wheel inequalities for stable set polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Antiweb-wheel inequalities and their separation problems over the stable set polytopes
+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 @@
+Tour Merging via Branch-Decomposition
@@ Property / cites work: Tour Merging via Branch-Decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+On the rank of mixed 0,1 polyhedra.
@@ Property / cites work: On the rank of mixed 0,1 polyhedra. / rank @@
+Normal rank
@@ Property / cites work @@
+Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
+Normal rank
@@ Property / cites work @@
+When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
+Normal rank
@@ Property / cites work @@
+Branch decompositions and minor containment
@@ Property / cites work: Branch decompositions and minor containment / rank @@
+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 @@
+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 @@
+Transitive packing
@@ Property / cites work: Transitive packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q4877166
@@ Property / cites work: Q4877166 / rank @@
+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 @@
+A class of facet producing graphs for vertex packing polyhedra
+Normal rank