Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155): Difference between revisions

@@ Property / cites work @@
+Maximum semidefinite and linear extension complexity of families of polytopes
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
+Normal rank
@@ Property / cites work @@
+No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i>
+Normal rank
@@ Property / cites work @@
+Monotone circuits for monotone weighted threshold functions
+Normal rank
@@ Property / cites work @@
+Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory 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 @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank
@@ Property / cites work @@
+On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
+Normal rank
@@ Property / cites work @@
+On the membership problem for the elementary closure of a polyhedron
+Normal rank
@@ Property / cites work @@
+Q4607935
@@ Property / cites work: Q4607935 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds for Polytopes in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Extension Complexity of Independent Set Polytopes
@@ Property / cites work: Extension Complexity of Independent Set Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for the Majority Function
@@ Property / cites work: Monotone Circuits for the Majority Function / rank @@
+Normal rank
@@ Property / cites work @@
+On the nonnegative rank of distance matrices
@@ Property / cites work: On the nonnegative rank of distance matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+The complexity of cover inequality separation
@@ Property / cites work: The complexity of cover inequality separation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537750
@@ Property / cites work: Q4537750 / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
+Normal rank
@@ Property / cites work @@
+Monotone circuits for matching require linear depth
+Normal rank
@@ Property / cites work @@
+Some \(0/1\) polytopes need exponential size extended formulations
+Normal rank
@@ Property / cites work @@
+The Matching Polytope has Exponential Extension Complexity
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+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 @@
+Improving Integrality Gaps via Chvátal-Gomory Rounding
+Normal rank
@@ Property / cites work @@
+Relating monotone formula size and monotone depth of Boolean functions
+Normal rank