Pitch, extension complexity, and covering problems (Q2060545): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bienstock, Daniel / rank
Normal rank
 
Property / author
 
Property / author: Bienstock, Daniel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2021.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3152027881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension complexity of combinatorial polytopes / 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: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening convex relaxations of 0/1-sets using Boolean formulas / 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: The complexity of cover inequality separation / 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: Symmetry Matters for Sizes of Extended Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 12:21, 27 July 2024

scientific article
Language Label Description Also known as
English
Pitch, extension complexity, and covering problems
scientific article

    Statements

    Pitch, extension complexity, and covering problems (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    minimum knapsack
    0 references
    covering problem
    0 references
    bounded pitch
    0 references
    separation algorithm
    0 references
    extension complexity
    0 references

    Identifiers