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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3042828318 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.01358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum semidefinite and linear extension complexity of families of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone circuits for monotone weighted threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Algebra Lift Operators for 0-1 Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate fixed-rank closures of covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the membership problem for the elementary closure of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity of Independent Set Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for the Majority Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonnegative rank of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cover inequality separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone circuits for matching require linear depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Integrality Gaps via Chvátal-Gomory Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating monotone formula size and monotone depth of Boolean functions / rank
 
Normal rank

Latest revision as of 21:28, 26 July 2024

scientific article
Language Label Description Also known as
English
Strengthening convex relaxations of 0/1-sets using Boolean formulas
scientific article

    Statements

    Strengthening convex relaxations of 0/1-sets using Boolean formulas (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references